./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-circular-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version b5237d83 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/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_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-circular-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/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-memcleanup) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e --- 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 02:38:34,268 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-22 02:38:34,271 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-22 02:38:34,312 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-22 02:38:34,313 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-22 02:38:34,316 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-22 02:38:34,319 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-22 02:38:34,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-22 02:38:34,325 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-22 02:38:34,332 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-22 02:38:34,333 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-22 02:38:34,334 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-22 02:38:34,335 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-22 02:38:34,335 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-22 02:38:34,336 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-22 02:38:34,338 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-22 02:38:34,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-22 02:38:34,339 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-22 02:38:34,341 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-22 02:38:34,347 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-22 02:38:34,349 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-22 02:38:34,353 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-22 02:38:34,355 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-22 02:38:34,356 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-22 02:38:34,369 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-22 02:38:34,370 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-22 02:38:34,371 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-22 02:38:34,373 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-22 02:38:34,373 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-22 02:38:34,375 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-22 02:38:34,375 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-22 02:38:34,376 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-22 02:38:34,378 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-22 02:38:34,379 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-22 02:38:34,382 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-22 02:38:34,382 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-22 02:38:34,383 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-22 02:38:34,383 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-22 02:38:34,385 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-22 02:38:34,387 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-22 02:38:34,388 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-22 02:38:34,389 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2022-11-22 02:38:34,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-22 02:38:34,433 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-22 02:38:34,434 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-22 02:38:34,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-22 02:38:34,435 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-22 02:38:34,435 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-22 02:38:34,435 INFO L138 SettingsManager]: * User list type=DISABLED [2022-11-22 02:38:34,436 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2022-11-22 02:38:34,436 INFO L138 SettingsManager]: * Explicit value domain=true [2022-11-22 02:38:34,436 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2022-11-22 02:38:34,437 INFO L138 SettingsManager]: * Octagon Domain=false [2022-11-22 02:38:34,438 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2022-11-22 02:38:34,438 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2022-11-22 02:38:34,438 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2022-11-22 02:38:34,438 INFO L138 SettingsManager]: * Interval Domain=false [2022-11-22 02:38:34,438 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2022-11-22 02:38:34,439 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2022-11-22 02:38:34,439 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2022-11-22 02:38:34,440 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-22 02:38:34,440 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-22 02:38:34,440 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-22 02:38:34,440 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-22 02:38:34,441 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-11-22 02:38:34,441 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-22 02:38:34,441 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-22 02:38:34,441 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-22 02:38:34,441 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-11-22 02:38:34,442 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-11-22 02:38:34,442 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-22 02:38:34,442 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-11-22 02:38:34,442 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-22 02:38:34,443 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-22 02:38:34,443 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-22 02:38:34,443 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-22 02:38:34,443 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:38:34,444 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-22 02:38:34,444 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2022-11-22 02:38:34,444 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-22 02:38:34,444 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2022-11-22 02:38:34,444 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-22 02:38:34,445 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-11-22 02:38:34,445 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_a5065875-bf47-4135-b763-a976b91a4f2c/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_a5065875-bf47-4135-b763-a976b91a4f2c/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-memcleanup) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Taipan Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f91abcd8d9f4c4a9bb166bca3090e9f421fd2afed3c0226bce3d2e7c0b6ce95e [2022-11-22 02:38:34,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-22 02:38:34,806 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-22 02:38:34,808 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-22 02:38:34,810 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-22 02:38:34,810 INFO L275 PluginConnector]: CDTParser initialized [2022-11-22 02:38:34,811 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/../../sv-benchmarks/c/forester-heap/sll-circular-2.i [2022-11-22 02:38:38,032 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-22 02:38:38,268 INFO L351 CDTParser]: Found 1 translation units. [2022-11-22 02:38:38,277 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/sv-benchmarks/c/forester-heap/sll-circular-2.i [2022-11-22 02:38:38,293 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/data/7ce49979c/fcc8c9560e0d4c92b03d38c23af2dc1c/FLAG17b41c126 [2022-11-22 02:38:38,306 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/data/7ce49979c/fcc8c9560e0d4c92b03d38c23af2dc1c [2022-11-22 02:38:38,309 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-22 02:38:38,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-22 02:38:38,312 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-22 02:38:38,312 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-22 02:38:38,316 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-22 02:38:38,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45e1c0ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38, skipping insertion in model container [2022-11-22 02:38:38,319 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,326 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-22 02:38:38,359 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-22 02:38:38,627 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2022-11-22 02:38:38,633 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2022-11-22 02:38:38,635 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2022-11-22 02:38:38,640 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:38:38,650 INFO L203 MainTranslator]: Completed pre-run [2022-11-22 02:38:38,685 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/sv-benchmarks/c/forester-heap/sll-circular-2.i[22324,22337] [2022-11-22 02:38:38,686 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/sv-benchmarks/c/forester-heap/sll-circular-2.i[22430,22443] [2022-11-22 02:38:38,688 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/sv-benchmarks/c/forester-heap/sll-circular-2.i[22554,22567] [2022-11-22 02:38:38,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-22 02:38:38,716 INFO L208 MainTranslator]: Completed translation [2022-11-22 02:38:38,717 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38 WrapperNode [2022-11-22 02:38:38,717 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-22 02:38:38,718 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-22 02:38:38,718 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-22 02:38:38,718 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-22 02:38:38,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,739 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,760 INFO L138 Inliner]: procedures = 119, calls = 28, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 119 [2022-11-22 02:38:38,760 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-22 02:38:38,761 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-22 02:38:38,761 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-22 02:38:38,762 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-22 02:38:38,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,799 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,801 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,808 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,824 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,831 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,834 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-22 02:38:38,835 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-22 02:38:38,840 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-22 02:38:38,840 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-22 02:38:38,841 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (1/1) ... [2022-11-22 02:38:38,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-22 02:38:38,861 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:38:38,879 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-22 02:38:38,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-22 02:38:38,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-22 02:38:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-22 02:38:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-22 02:38:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-22 02:38:38,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-22 02:38:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-22 02:38:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-22 02:38:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-22 02:38:38,931 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-22 02:38:38,931 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-22 02:38:39,083 INFO L235 CfgBuilder]: Building ICFG [2022-11-22 02:38:39,085 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-22 02:38:39,522 INFO L276 CfgBuilder]: Performing block encoding [2022-11-22 02:38:39,585 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-22 02:38:39,585 INFO L300 CfgBuilder]: Removed 9 assume(true) statements. [2022-11-22 02:38:39,588 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:38:39 BoogieIcfgContainer [2022-11-22 02:38:39,588 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-22 02:38:39,591 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-22 02:38:39,591 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-22 02:38:39,594 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-22 02:38:39,594 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 02:38:38" (1/3) ... [2022-11-22 02:38:39,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70266229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:38:39, skipping insertion in model container [2022-11-22 02:38:39,605 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 02:38:38" (2/3) ... [2022-11-22 02:38:39,606 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@70266229 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 02:38:39, skipping insertion in model container [2022-11-22 02:38:39,607 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:38:39" (3/3) ... [2022-11-22 02:38:39,608 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-circular-2.i [2022-11-22 02:38:39,627 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-22 02:38:39,628 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2022-11-22 02:38:39,694 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-22 02:38:39,701 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;@55050ac2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-22 02:38:39,702 INFO L358 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2022-11-22 02:38:39,706 INFO L276 IsEmpty]: Start isEmpty. Operand has 90 states, 43 states have (on average 2.511627906976744) internal successors, (108), 89 states have internal predecessors, (108), 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 02:38:39,712 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-22 02:38:39,712 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:39,713 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-22 02:38:39,713 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:39,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:39,721 INFO L85 PathProgramCache]: Analyzing trace with hash 7320, now seen corresponding path program 1 times [2022-11-22 02:38:39,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:39,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1408069831] [2022-11-22 02:38:39,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:39,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:39,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:39,939 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 02:38:39,940 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:39,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1408069831] [2022-11-22 02:38:39,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1408069831] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:39,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:39,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:38:39,943 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182064794] [2022-11-22 02:38:39,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:39,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:38:39,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:39,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:38:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:38:39,980 INFO L87 Difference]: Start difference. First operand has 90 states, 43 states have (on average 2.511627906976744) internal successors, (108), 89 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 02:38:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:40,159 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2022-11-22 02:38:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:38:40,162 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-22 02:38:40,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:40,173 INFO L225 Difference]: With dead ends: 96 [2022-11-22 02:38:40,174 INFO L226 Difference]: Without dead ends: 95 [2022-11-22 02:38:40,176 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 02:38:40,179 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 77 mSDsluCounter, 9 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:40,181 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 61 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:38:40,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-11-22 02:38:40,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 85. [2022-11-22 02:38:40,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 43 states have (on average 2.116279069767442) internal successors, (91), 84 states have internal predecessors, (91), 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 02:38:40,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 91 transitions. [2022-11-22 02:38:40,217 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 91 transitions. Word has length 2 [2022-11-22 02:38:40,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:40,218 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 91 transitions. [2022-11-22 02:38:40,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 02:38:40,218 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 91 transitions. [2022-11-22 02:38:40,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2022-11-22 02:38:40,218 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:40,219 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2022-11-22 02:38:40,219 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-22 02:38:40,219 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:40,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:40,220 INFO L85 PathProgramCache]: Analyzing trace with hash 7321, now seen corresponding path program 1 times [2022-11-22 02:38:40,220 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:40,220 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290937421] [2022-11-22 02:38:40,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:40,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:40,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:40,323 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 02:38:40,324 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:40,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290937421] [2022-11-22 02:38:40,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290937421] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:40,325 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:40,325 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-11-22 02:38:40,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1568817185] [2022-11-22 02:38:40,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:40,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:38:40,327 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:40,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:38:40,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:38:40,328 INFO L87 Difference]: Start difference. First operand 85 states and 91 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 02:38:40,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:40,422 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2022-11-22 02:38:40,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:38:40,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 2 [2022-11-22 02:38:40,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:40,424 INFO L225 Difference]: With dead ends: 93 [2022-11-22 02:38:40,424 INFO L226 Difference]: Without dead ends: 93 [2022-11-22 02:38:40,425 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 02:38:40,426 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 10 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:40,427 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 64 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:38:40,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-11-22 02:38:40,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 81. [2022-11-22 02:38:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 43 states have (on average 2.0232558139534884) internal successors, (87), 80 states have internal predecessors, (87), 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 02:38:40,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2022-11-22 02:38:40,441 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 2 [2022-11-22 02:38:40,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:40,441 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2022-11-22 02:38:40,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 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 02:38:40,442 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2022-11-22 02:38:40,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:38:40,442 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:40,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:38:40,442 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-22 02:38:40,443 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:40,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:40,443 INFO L85 PathProgramCache]: Analyzing trace with hash -1824801511, now seen corresponding path program 1 times [2022-11-22 02:38:40,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:40,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959953391] [2022-11-22 02:38:40,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:40,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:40,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:40,588 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 02:38:40,588 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:40,588 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959953391] [2022-11-22 02:38:40,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959953391] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:40,589 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:40,589 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:38:40,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795845681] [2022-11-22 02:38:40,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:40,590 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:38:40,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:40,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:38:40,591 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:38:40,592 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:38:40,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:40,726 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-11-22 02:38:40,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:38:40,726 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-11-22 02:38:40,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:40,731 INFO L225 Difference]: With dead ends: 79 [2022-11-22 02:38:40,731 INFO L226 Difference]: Without dead ends: 79 [2022-11-22 02:38:40,732 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:38:40,737 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 120 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:40,740 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 41 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:38:40,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-11-22 02:38:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 70. [2022-11-22 02:38:40,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 43 states have (on average 1.7674418604651163) internal successors, (76), 69 states have internal predecessors, (76), 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 02:38:40,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 76 transitions. [2022-11-22 02:38:40,750 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 76 transitions. Word has length 6 [2022-11-22 02:38:40,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:40,751 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 76 transitions. [2022-11-22 02:38:40,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:38:40,751 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 76 transitions. [2022-11-22 02:38:40,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-11-22 02:38:40,752 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:40,752 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-11-22 02:38:40,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-11-22 02:38:40,753 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:40,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:40,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1824801510, now seen corresponding path program 1 times [2022-11-22 02:38:40,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:40,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597105134] [2022-11-22 02:38:40,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:40,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:40,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:41,006 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 02:38:41,006 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:41,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [597105134] [2022-11-22 02:38:41,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [597105134] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:41,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:41,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-22 02:38:41,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458089144] [2022-11-22 02:38:41,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:41,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-11-22 02:38:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:41,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-11-22 02:38:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-11-22 02:38:41,009 INFO L87 Difference]: Start difference. First operand 70 states and 76 transitions. Second operand has 4 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 02:38:41,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:41,170 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2022-11-22 02:38:41,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-11-22 02:38:41,170 INFO L78 Accepts]: Start accepts. Automaton has has 4 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 02:38:41,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:41,171 INFO L225 Difference]: With dead ends: 87 [2022-11-22 02:38:41,171 INFO L226 Difference]: Without dead ends: 87 [2022-11-22 02:38:41,172 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 02:38:41,174 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 73 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 89 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 89 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:41,175 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 80 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 89 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:38:41,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-11-22 02:38:41,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 75. [2022-11-22 02:38:41,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 48 states have (on average 1.7083333333333333) internal successors, (82), 74 states have internal predecessors, (82), 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 02:38:41,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 82 transitions. [2022-11-22 02:38:41,181 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 82 transitions. Word has length 6 [2022-11-22 02:38:41,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:41,181 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 82 transitions. [2022-11-22 02:38:41,181 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 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 02:38:41,181 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 82 transitions. [2022-11-22 02:38:41,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 02:38:41,182 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:41,182 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:41,182 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-11-22 02:38:41,183 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:41,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:41,183 INFO L85 PathProgramCache]: Analyzing trace with hash -1287407321, now seen corresponding path program 1 times [2022-11-22 02:38:41,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:41,184 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1848175484] [2022-11-22 02:38:41,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:41,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:41,219 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:41,446 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 02:38:41,446 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:41,447 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1848175484] [2022-11-22 02:38:41,447 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1848175484] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:41,447 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:41,447 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:38:41,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965316192] [2022-11-22 02:38:41,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:41,462 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:38:41,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:41,463 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:38:41,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:38:41,464 INFO L87 Difference]: Start difference. First operand 75 states and 82 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 02:38:41,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:41,643 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-11-22 02:38:41,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-11-22 02:38:41,643 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2022-11-22 02:38:41,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:41,644 INFO L225 Difference]: With dead ends: 74 [2022-11-22 02:38:41,644 INFO L226 Difference]: Without dead ends: 74 [2022-11-22 02:38:41,644 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:38:41,645 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 51 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:41,646 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 106 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:38:41,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-11-22 02:38:41,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-11-22 02:38:41,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 48 states have (on average 1.6875) internal successors, (81), 73 states have internal predecessors, (81), 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 02:38:41,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-11-22 02:38:41,650 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 8 [2022-11-22 02:38:41,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:41,651 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-11-22 02:38:41,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 02:38:41,651 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-11-22 02:38:41,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-11-22 02:38:41,652 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:41,652 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:41,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-11-22 02:38:41,652 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:41,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:41,653 INFO L85 PathProgramCache]: Analyzing trace with hash -1287407320, now seen corresponding path program 1 times [2022-11-22 02:38:41,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:41,653 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083843285] [2022-11-22 02:38:41,653 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:41,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:41,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:41,914 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 02:38:41,915 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:41,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083843285] [2022-11-22 02:38:41,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1083843285] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:41,916 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:41,916 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-11-22 02:38:41,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165990522] [2022-11-22 02:38:41,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:41,917 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:38:41,917 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:41,918 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:38:41,918 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:38:41,918 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 02:38:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:42,075 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-11-22 02:38:42,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:38:42,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2022-11-22 02:38:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:42,076 INFO L225 Difference]: With dead ends: 70 [2022-11-22 02:38:42,076 INFO L226 Difference]: Without dead ends: 70 [2022-11-22 02:38:42,077 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:38:42,084 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 16 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:42,085 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 151 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:38:42,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-11-22 02:38:42,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 64. [2022-11-22 02:38:42,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 43 states have (on average 1.627906976744186) internal successors, (70), 63 states have internal predecessors, (70), 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 02:38:42,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-11-22 02:38:42,088 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 8 [2022-11-22 02:38:42,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:42,089 INFO L495 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-11-22 02:38:42,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 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 02:38:42,089 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-11-22 02:38:42,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-11-22 02:38:42,090 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:42,090 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:42,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-11-22 02:38:42,090 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:42,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:42,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1260581677, now seen corresponding path program 1 times [2022-11-22 02:38:42,095 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:42,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211211344] [2022-11-22 02:38:42,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:42,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:42,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:42,384 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 02:38:42,385 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:42,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211211344] [2022-11-22 02:38:42,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1211211344] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:42,385 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:42,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:38:42,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344442855] [2022-11-22 02:38:42,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:42,387 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:38:42,387 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:42,387 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:38:42,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:38:42,388 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 02:38:42,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:42,618 INFO L93 Difference]: Finished difference Result 144 states and 155 transitions. [2022-11-22 02:38:42,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:38:42,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 9 [2022-11-22 02:38:42,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:42,620 INFO L225 Difference]: With dead ends: 144 [2022-11-22 02:38:42,620 INFO L226 Difference]: Without dead ends: 144 [2022-11-22 02:38:42,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:38:42,621 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 174 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:42,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [174 Valid, 227 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:38:42,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-11-22 02:38:42,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 69. [2022-11-22 02:38:42,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 68 states have internal predecessors, (76), 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 02:38:42,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 76 transitions. [2022-11-22 02:38:42,626 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 76 transitions. Word has length 9 [2022-11-22 02:38:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:42,626 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 76 transitions. [2022-11-22 02:38:42,627 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.2857142857142858) internal successors, (9), 6 states have internal predecessors, (9), 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 02:38:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 76 transitions. [2022-11-22 02:38:42,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:38:42,627 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:42,627 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:42,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-11-22 02:38:42,628 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:42,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:42,628 INFO L85 PathProgramCache]: Analyzing trace with hash -423322160, now seen corresponding path program 1 times [2022-11-22 02:38:42,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:42,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [8386790] [2022-11-22 02:38:42,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:42,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:42,831 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 02:38:42,831 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:42,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [8386790] [2022-11-22 02:38:42,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [8386790] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:42,832 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:42,832 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:38:42,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087700758] [2022-11-22 02:38:42,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:42,832 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:38:42,833 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:42,833 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:38:42,833 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:38:42,834 INFO L87 Difference]: Start difference. First operand 69 states and 76 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:38:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:43,034 INFO L93 Difference]: Finished difference Result 105 states and 115 transitions. [2022-11-22 02:38:43,035 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:38:43,035 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 02:38:43,035 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:43,036 INFO L225 Difference]: With dead ends: 105 [2022-11-22 02:38:43,036 INFO L226 Difference]: Without dead ends: 105 [2022-11-22 02:38:43,036 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:38:43,037 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 263 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 263 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:43,037 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [263 Valid, 81 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:38:43,038 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-11-22 02:38:43,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 84. [2022-11-22 02:38:43,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 63 states have (on average 1.6825396825396826) internal successors, (106), 83 states have internal predecessors, (106), 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 02:38:43,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 106 transitions. [2022-11-22 02:38:43,043 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 106 transitions. Word has length 10 [2022-11-22 02:38:43,043 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:43,043 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 106 transitions. [2022-11-22 02:38:43,043 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:38:43,043 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 106 transitions. [2022-11-22 02:38:43,044 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-11-22 02:38:43,044 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:43,044 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:43,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-11-22 02:38:43,044 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:43,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:43,045 INFO L85 PathProgramCache]: Analyzing trace with hash -423322159, now seen corresponding path program 1 times [2022-11-22 02:38:43,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:43,045 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925896839] [2022-11-22 02:38:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:43,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:43,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:43,406 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 02:38:43,406 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:43,406 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925896839] [2022-11-22 02:38:43,406 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1925896839] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:43,407 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:43,407 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:38:43,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [652821016] [2022-11-22 02:38:43,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:43,408 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:38:43,408 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:43,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:38:43,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:38:43,409 INFO L87 Difference]: Start difference. First operand 84 states and 106 transitions. Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:38:43,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:43,618 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2022-11-22 02:38:43,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-11-22 02:38:43,619 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-11-22 02:38:43,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:43,620 INFO L225 Difference]: With dead ends: 118 [2022-11-22 02:38:43,620 INFO L226 Difference]: Without dead ends: 118 [2022-11-22 02:38:43,620 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-11-22 02:38:43,621 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 248 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 124 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 248 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 155 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 124 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:43,621 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [248 Valid, 103 Invalid, 155 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 124 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:38:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-11-22 02:38:43,624 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 91. [2022-11-22 02:38:43,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 70 states have (on average 1.5571428571428572) internal successors, (109), 90 states have internal predecessors, (109), 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 02:38:43,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 109 transitions. [2022-11-22 02:38:43,625 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 109 transitions. Word has length 10 [2022-11-22 02:38:43,625 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:43,625 INFO L495 AbstractCegarLoop]: Abstraction has 91 states and 109 transitions. [2022-11-22 02:38:43,625 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-22 02:38:43,625 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 109 transitions. [2022-11-22 02:38:43,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-11-22 02:38:43,626 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:43,626 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:43,626 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-11-22 02:38:43,626 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:43,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:43,627 INFO L85 PathProgramCache]: Analyzing trace with hash -1806268972, now seen corresponding path program 1 times [2022-11-22 02:38:43,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:43,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [923076022] [2022-11-22 02:38:43,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:43,627 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:43,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:43,757 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 02:38:43,758 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:43,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [923076022] [2022-11-22 02:38:43,758 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [923076022] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:43,758 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:43,758 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:38:43,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329655560] [2022-11-22 02:38:43,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:43,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-11-22 02:38:43,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:43,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-11-22 02:38:43,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-11-22 02:38:43,760 INFO L87 Difference]: Start difference. First operand 91 states and 109 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 02:38:43,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:43,855 INFO L93 Difference]: Finished difference Result 91 states and 109 transitions. [2022-11-22 02:38:43,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-22 02:38:43,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 12 [2022-11-22 02:38:43,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:43,857 INFO L225 Difference]: With dead ends: 91 [2022-11-22 02:38:43,857 INFO L226 Difference]: Without dead ends: 91 [2022-11-22 02:38:43,857 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:38:43,858 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 12 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:43,858 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 175 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:38:43,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-11-22 02:38:43,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 89. [2022-11-22 02:38:43,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 88 states have internal predecessors, (107), 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 02:38:43,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 107 transitions. [2022-11-22 02:38:43,862 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 107 transitions. Word has length 12 [2022-11-22 02:38:43,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:43,863 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 107 transitions. [2022-11-22 02:38:43,863 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 02:38:43,863 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 107 transitions. [2022-11-22 02:38:43,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 02:38:43,864 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:43,864 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:43,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-11-22 02:38:43,864 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:43,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:43,865 INFO L85 PathProgramCache]: Analyzing trace with hash -1166409919, now seen corresponding path program 1 times [2022-11-22 02:38:43,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:43,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277819001] [2022-11-22 02:38:43,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:43,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:43,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:44,191 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 02:38:44,191 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:44,191 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277819001] [2022-11-22 02:38:44,191 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1277819001] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:44,191 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:44,192 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:38:44,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499731905] [2022-11-22 02:38:44,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:44,193 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:38:44,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:44,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:38:44,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:38:44,194 INFO L87 Difference]: Start difference. First operand 89 states and 107 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 02:38:44,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:44,467 INFO L93 Difference]: Finished difference Result 119 states and 134 transitions. [2022-11-22 02:38:44,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:38:44,470 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 13 [2022-11-22 02:38:44,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:44,470 INFO L225 Difference]: With dead ends: 119 [2022-11-22 02:38:44,470 INFO L226 Difference]: Without dead ends: 119 [2022-11-22 02:38:44,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:38:44,471 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 178 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:44,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 188 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:38:44,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-11-22 02:38:44,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2022-11-22 02:38:44,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.5555555555555556) internal successors, (112), 91 states have internal predecessors, (112), 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 02:38:44,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2022-11-22 02:38:44,475 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 112 transitions. Word has length 13 [2022-11-22 02:38:44,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:44,476 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 112 transitions. [2022-11-22 02:38:44,476 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 02:38:44,476 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 112 transitions. [2022-11-22 02:38:44,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-11-22 02:38:44,477 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:44,477 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:44,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-11-22 02:38:44,477 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:44,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:44,478 INFO L85 PathProgramCache]: Analyzing trace with hash -1166409918, now seen corresponding path program 1 times [2022-11-22 02:38:44,478 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:44,478 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800234505] [2022-11-22 02:38:44,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:44,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:44,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:44,819 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 02:38:44,819 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:44,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800234505] [2022-11-22 02:38:44,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800234505] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:44,820 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:44,820 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:38:44,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730067554] [2022-11-22 02:38:44,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:44,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:38:44,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:44,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:38:44,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:38:44,821 INFO L87 Difference]: Start difference. First operand 92 states and 112 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 02:38:45,125 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:45,125 INFO L93 Difference]: Finished difference Result 131 states and 145 transitions. [2022-11-22 02:38:45,126 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:38:45,126 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 13 [2022-11-22 02:38:45,126 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:45,127 INFO L225 Difference]: With dead ends: 131 [2022-11-22 02:38:45,127 INFO L226 Difference]: Without dead ends: 131 [2022-11-22 02:38:45,127 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:38:45,128 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 148 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 183 SdHoareTripleChecker+Invalid, 253 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:45,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [148 Valid, 183 Invalid, 253 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:38:45,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-11-22 02:38:45,130 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 92. [2022-11-22 02:38:45,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 72 states have (on average 1.5416666666666667) internal successors, (111), 91 states have internal predecessors, (111), 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 02:38:45,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 111 transitions. [2022-11-22 02:38:45,131 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 111 transitions. Word has length 13 [2022-11-22 02:38:45,131 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:45,131 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 111 transitions. [2022-11-22 02:38:45,131 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 6 states have internal predecessors, (13), 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 02:38:45,132 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 111 transitions. [2022-11-22 02:38:45,132 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-11-22 02:38:45,132 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:45,132 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:45,132 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-11-22 02:38:45,133 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:45,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:45,133 INFO L85 PathProgramCache]: Analyzing trace with hash 2136007192, now seen corresponding path program 1 times [2022-11-22 02:38:45,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:45,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294296804] [2022-11-22 02:38:45,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:45,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:45,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:45,178 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 02:38:45,178 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:45,178 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294296804] [2022-11-22 02:38:45,178 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294296804] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:45,179 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:45,179 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-11-22 02:38:45,179 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857950148] [2022-11-22 02:38:45,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:45,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-11-22 02:38:45,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:45,180 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-11-22 02:38:45,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-11-22 02:38:45,180 INFO L87 Difference]: Start difference. First operand 92 states and 111 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 02:38:45,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:45,229 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2022-11-22 02:38:45,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-11-22 02:38:45,230 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-11-22 02:38:45,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:45,232 INFO L225 Difference]: With dead ends: 150 [2022-11-22 02:38:45,232 INFO L226 Difference]: Without dead ends: 150 [2022-11-22 02:38:45,232 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 02:38:45,233 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 55 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:45,234 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 105 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-11-22 02:38:45,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-11-22 02:38:45,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 102. [2022-11-22 02:38:45,237 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 82 states have (on average 1.5) internal successors, (123), 101 states have internal predecessors, (123), 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 02:38:45,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-11-22 02:38:45,238 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 15 [2022-11-22 02:38:45,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:45,238 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-11-22 02:38:45,238 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 02:38:45,238 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-11-22 02:38:45,239 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 02:38:45,239 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:45,239 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:45,239 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-11-22 02:38:45,239 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:45,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:45,240 INFO L85 PathProgramCache]: Analyzing trace with hash 2084441583, now seen corresponding path program 1 times [2022-11-22 02:38:45,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:45,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137299556] [2022-11-22 02:38:45,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:45,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:45,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:45,479 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 02:38:45,479 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:45,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137299556] [2022-11-22 02:38:45,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137299556] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:45,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:45,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:38:45,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767702353] [2022-11-22 02:38:45,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:45,481 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:38:45,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:45,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:38:45,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:38:45,481 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 02:38:45,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:45,665 INFO L93 Difference]: Finished difference Result 141 states and 157 transitions. [2022-11-22 02:38:45,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:38:45,666 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 16 [2022-11-22 02:38:45,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:45,667 INFO L225 Difference]: With dead ends: 141 [2022-11-22 02:38:45,667 INFO L226 Difference]: Without dead ends: 141 [2022-11-22 02:38:45,667 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:38:45,667 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 238 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 238 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:45,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [238 Valid, 145 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 113 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-11-22 02:38:45,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-11-22 02:38:45,672 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 105. [2022-11-22 02:38:45,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.4941176470588236) internal successors, (127), 104 states have internal predecessors, (127), 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 02:38:45,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 127 transitions. [2022-11-22 02:38:45,675 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 127 transitions. Word has length 16 [2022-11-22 02:38:45,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:45,675 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 127 transitions. [2022-11-22 02:38:45,675 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 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 02:38:45,675 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 127 transitions. [2022-11-22 02:38:45,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-11-22 02:38:45,678 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:45,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:45,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-11-22 02:38:45,679 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:45,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:45,679 INFO L85 PathProgramCache]: Analyzing trace with hash 2065219022, now seen corresponding path program 1 times [2022-11-22 02:38:45,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:45,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002100245] [2022-11-22 02:38:45,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:45,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:45,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:46,222 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 02:38:46,223 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:46,223 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002100245] [2022-11-22 02:38:46,223 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002100245] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:46,223 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:46,223 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 02:38:46,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922674006] [2022-11-22 02:38:46,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:46,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:38:46,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:46,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:38:46,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:38:46,225 INFO L87 Difference]: Start difference. First operand 105 states and 127 transitions. Second operand has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 02:38:46,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:46,739 INFO L93 Difference]: Finished difference Result 120 states and 131 transitions. [2022-11-22 02:38:46,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 02:38:46,740 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2022-11-22 02:38:46,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:46,741 INFO L225 Difference]: With dead ends: 120 [2022-11-22 02:38:46,741 INFO L226 Difference]: Without dead ends: 120 [2022-11-22 02:38:46,741 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=82, Invalid=190, Unknown=0, NotChecked=0, Total=272 [2022-11-22 02:38:46,742 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 152 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 302 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 252 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 302 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:46,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [152 Valid, 252 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 302 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-11-22 02:38:46,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-11-22 02:38:46,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 105. [2022-11-22 02:38:46,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.4705882352941178) internal successors, (125), 104 states have internal predecessors, (125), 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 02:38:46,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 125 transitions. [2022-11-22 02:38:46,745 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 125 transitions. Word has length 16 [2022-11-22 02:38:46,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:46,745 INFO L495 AbstractCegarLoop]: Abstraction has 105 states and 125 transitions. [2022-11-22 02:38:46,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 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 02:38:46,745 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 125 transitions. [2022-11-22 02:38:46,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:38:46,746 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:46,746 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:46,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-11-22 02:38:46,746 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:46,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:46,747 INFO L85 PathProgramCache]: Analyzing trace with hash 193251577, now seen corresponding path program 1 times [2022-11-22 02:38:46,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:46,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [417982194] [2022-11-22 02:38:46,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:46,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:46,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:46,936 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 02:38:46,936 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:46,936 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [417982194] [2022-11-22 02:38:46,936 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [417982194] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:46,936 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:46,936 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:38:46,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940649] [2022-11-22 02:38:46,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:46,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:38:46,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:46,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:38:46,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=35, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:38:46,937 INFO L87 Difference]: Start difference. First operand 105 states and 125 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 02:38:47,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:47,160 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-11-22 02:38:47,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:38:47,161 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2022-11-22 02:38:47,161 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:47,161 INFO L225 Difference]: With dead ends: 146 [2022-11-22 02:38:47,161 INFO L226 Difference]: Without dead ends: 146 [2022-11-22 02:38:47,162 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:38:47,162 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 244 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 244 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:47,163 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [244 Valid, 202 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:38:47,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-11-22 02:38:47,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 108. [2022-11-22 02:38:47,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 88 states have (on average 1.4545454545454546) internal successors, (128), 107 states have internal predecessors, (128), 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 02:38:47,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 128 transitions. [2022-11-22 02:38:47,166 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 128 transitions. Word has length 17 [2022-11-22 02:38:47,166 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:47,166 INFO L495 AbstractCegarLoop]: Abstraction has 108 states and 128 transitions. [2022-11-22 02:38:47,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 02:38:47,166 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 128 transitions. [2022-11-22 02:38:47,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:38:47,167 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:47,167 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:47,167 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-11-22 02:38:47,167 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:47,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:47,168 INFO L85 PathProgramCache]: Analyzing trace with hash -403091939, now seen corresponding path program 1 times [2022-11-22 02:38:47,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:47,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541579817] [2022-11-22 02:38:47,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:47,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:47,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:47,488 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 02:38:47,488 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:47,488 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541579817] [2022-11-22 02:38:47,488 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541579817] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:47,488 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:47,488 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:38:47,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2030578082] [2022-11-22 02:38:47,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:47,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:38:47,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:47,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:38:47,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:38:47,490 INFO L87 Difference]: Start difference. First operand 108 states and 128 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 02:38:47,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:47,772 INFO L93 Difference]: Finished difference Result 128 states and 143 transitions. [2022-11-22 02:38:47,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-22 02:38:47,773 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 17 [2022-11-22 02:38:47,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:47,774 INFO L225 Difference]: With dead ends: 128 [2022-11-22 02:38:47,774 INFO L226 Difference]: Without dead ends: 128 [2022-11-22 02:38:47,774 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-11-22 02:38:47,774 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 192 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:47,775 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [192 Valid, 186 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:38:47,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-11-22 02:38:47,777 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 112. [2022-11-22 02:38:47,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.4456521739130435) internal successors, (133), 111 states have internal predecessors, (133), 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 02:38:47,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 133 transitions. [2022-11-22 02:38:47,778 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 133 transitions. Word has length 17 [2022-11-22 02:38:47,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:47,778 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 133 transitions. [2022-11-22 02:38:47,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 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 02:38:47,778 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 133 transitions. [2022-11-22 02:38:47,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-11-22 02:38:47,779 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:47,779 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:47,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-11-22 02:38:47,779 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:47,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:47,780 INFO L85 PathProgramCache]: Analyzing trace with hash -403091938, now seen corresponding path program 1 times [2022-11-22 02:38:47,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:47,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829930968] [2022-11-22 02:38:47,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:47,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:47,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:48,101 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 02:38:48,101 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:48,101 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829930968] [2022-11-22 02:38:48,101 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [829930968] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:48,101 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:48,102 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-11-22 02:38:48,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865434085] [2022-11-22 02:38:48,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:48,102 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-22 02:38:48,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:48,103 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-22 02:38:48,103 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-11-22 02:38:48,103 INFO L87 Difference]: Start difference. First operand 112 states and 133 transitions. Second operand has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 02:38:48,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:48,345 INFO L93 Difference]: Finished difference Result 139 states and 152 transitions. [2022-11-22 02:38:48,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:38:48,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 17 [2022-11-22 02:38:48,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:48,346 INFO L225 Difference]: With dead ends: 139 [2022-11-22 02:38:48,346 INFO L226 Difference]: Without dead ends: 139 [2022-11-22 02:38:48,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:38:48,347 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 178 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 176 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 178 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:48,347 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [178 Valid, 150 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 176 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:38:48,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2022-11-22 02:38:48,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 112. [2022-11-22 02:38:48,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.434782608695652) internal successors, (132), 111 states have internal predecessors, (132), 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 02:38:48,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 132 transitions. [2022-11-22 02:38:48,350 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 132 transitions. Word has length 17 [2022-11-22 02:38:48,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:48,350 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 132 transitions. [2022-11-22 02:38:48,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 02:38:48,351 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 132 transitions. [2022-11-22 02:38:48,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 02:38:48,351 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:48,351 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:48,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-11-22 02:38:48,351 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:48,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:48,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1693608402, now seen corresponding path program 1 times [2022-11-22 02:38:48,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:48,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [273317489] [2022-11-22 02:38:48,352 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:48,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:48,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:48,577 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 02:38:48,577 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:48,577 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [273317489] [2022-11-22 02:38:48,577 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [273317489] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:48,577 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:48,577 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-22 02:38:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1400566315] [2022-11-22 02:38:48,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:48,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-22 02:38:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-22 02:38:48,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-11-22 02:38:48,579 INFO L87 Difference]: Start difference. First operand 112 states and 132 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 02:38:48,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:48,799 INFO L93 Difference]: Finished difference Result 126 states and 139 transitions. [2022-11-22 02:38:48,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-22 02:38:48,800 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 18 [2022-11-22 02:38:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:48,800 INFO L225 Difference]: With dead ends: 126 [2022-11-22 02:38:48,800 INFO L226 Difference]: Without dead ends: 122 [2022-11-22 02:38:48,801 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-11-22 02:38:48,801 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 141 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:48,802 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 199 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:38:48,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-11-22 02:38:48,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 110. [2022-11-22 02:38:48,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 90 states have (on average 1.4333333333333333) internal successors, (129), 109 states have internal predecessors, (129), 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 02:38:48,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 129 transitions. [2022-11-22 02:38:48,807 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 129 transitions. Word has length 18 [2022-11-22 02:38:48,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:48,807 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 129 transitions. [2022-11-22 02:38:48,807 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 7 states have internal predecessors, (18), 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 02:38:48,807 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 129 transitions. [2022-11-22 02:38:48,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-11-22 02:38:48,808 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:48,808 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:48,808 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-11-22 02:38:48,808 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:48,809 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:48,809 INFO L85 PathProgramCache]: Analyzing trace with hash 303022428, now seen corresponding path program 1 times [2022-11-22 02:38:48,809 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:48,809 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [644810395] [2022-11-22 02:38:48,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:48,810 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:48,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:49,106 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:38:49,106 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:49,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [644810395] [2022-11-22 02:38:49,106 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [644810395] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-22 02:38:49,106 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2079487392] [2022-11-22 02:38:49,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:49,107 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:38:49,107 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/z3 [2022-11-22 02:38:49,110 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-22 02:38:49,120 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-22 02:38:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:49,261 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 25 conjunts are in the unsatisfiable core [2022-11-22 02:38:49,266 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-22 02:38:49,312 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-22 02:38:49,412 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-11-22 02:38:49,413 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-11-22 02:38:49,489 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:38:49,608 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:38:49,608 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-22 02:38:49,658 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:38:49,658 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 28 [2022-11-22 02:38:49,730 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-22 02:38:49,730 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-11-22 02:38:49,764 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-11-22 02:38:49,768 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:38:49,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-22 02:38:49,783 WARN L837 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_451 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~x~0#1.base| v_ArrVal_451) |c_ULTIMATE.start_main_~head~0#1.base|) |c_ULTIMATE.start_main_~head~0#1.offset|) 0))) is different from false [2022-11-22 02:38:49,854 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:38:49,855 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 20 [2022-11-22 02:38:49,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-22 02:38:49,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 36 [2022-11-22 02:38:49,871 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2022-11-22 02:38:50,048 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2022-11-22 02:38:50,048 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2079487392] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-22 02:38:50,048 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [716304058] [2022-11-22 02:38:50,068 INFO L159 IcfgInterpreter]: Started Sifa with 17 locations of interest [2022-11-22 02:38:50,068 INFO L166 IcfgInterpreter]: Building call graph [2022-11-22 02:38:50,073 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2022-11-22 02:38:50,078 INFO L176 IcfgInterpreter]: Starting interpretation [2022-11-22 02:38:50,079 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2022-11-22 02:38:50,124 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,125 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,127 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 22 [2022-11-22 02:38:50,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,147 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 21 [2022-11-22 02:38:50,159 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:38:50,166 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:38:50,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,190 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2022-11-22 02:38:50,201 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,202 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-22 02:38:50,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,217 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2022-11-22 02:38:50,273 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,275 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,276 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,278 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,279 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 8 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 35 [2022-11-22 02:38:50,321 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-22 02:38:50,338 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,341 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-22 02:38:50,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-11-22 02:38:50,403 INFO L321 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-11-22 02:38:50,403 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 47 [2022-11-22 02:38:50,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,425 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-22 02:38:50,441 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 33 [2022-11-22 02:38:50,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,496 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 24 [2022-11-22 02:38:50,511 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,513 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,514 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2022-11-22 02:38:50,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,534 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 42 [2022-11-22 02:38:50,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,607 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,614 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 13 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 48 [2022-11-22 02:38:50,658 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,660 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-22 02:38:50,673 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,674 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 21 [2022-11-22 02:38:50,694 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,696 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,698 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,701 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 45 [2022-11-22 02:38:50,782 INFO L321 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-11-22 02:38:50,782 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 199 treesize of output 120 [2022-11-22 02:38:50,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,807 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,808 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2022-11-22 02:38:50,825 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,834 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:50,835 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 9 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 47 [2022-11-22 02:38:51,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,036 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:38:51,044 INFO L321 Elim1Store]: treesize reduction 32, result has 3.0 percent of original size [2022-11-22 02:38:51,045 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 364 [2022-11-22 02:38:51,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,071 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:38:51,078 INFO L321 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-11-22 02:38:51,079 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 459 treesize of output 437 [2022-11-22 02:38:51,098 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,106 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:38:51,155 INFO L321 Elim1Store]: treesize reduction 66, result has 30.5 percent of original size [2022-11-22 02:38:51,156 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 453 treesize of output 455 [2022-11-22 02:38:51,401 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,526 INFO L321 Elim1Store]: treesize reduction 278, result has 12.0 percent of original size [2022-11-22 02:38:51,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 19 case distinctions, treesize of input 461 treesize of output 468 [2022-11-22 02:38:51,666 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:38:51,786 INFO L321 Elim1Store]: treesize reduction 68, result has 28.4 percent of original size [2022-11-22 02:38:51,787 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 555 treesize of output 440 [2022-11-22 02:38:51,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:51,860 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:38:51,938 INFO L321 Elim1Store]: treesize reduction 170, result has 17.1 percent of original size [2022-11-22 02:38:51,939 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 13 case distinctions, treesize of input 504 treesize of output 490 [2022-11-22 02:38:51,967 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:38:52,013 INFO L321 Elim1Store]: treesize reduction 100, result has 16.0 percent of original size [2022-11-22 02:38:52,014 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 491 treesize of output 477 [2022-11-22 02:38:52,458 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:38:52,576 INFO L321 Elim1Store]: treesize reduction 176, result has 15.8 percent of original size [2022-11-22 02:38:52,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 812 treesize of output 506 [2022-11-22 02:38:52,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:38:52,768 INFO L321 Elim1Store]: treesize reduction 188, result has 17.9 percent of original size [2022-11-22 02:38:52,769 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 823 treesize of output 721 [2022-11-22 02:38:52,815 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:52,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-22 02:38:52,820 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-22 02:38:53,001 INFO L321 Elim1Store]: treesize reduction 424, result has 12.9 percent of original size [2022-11-22 02:38:53,001 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 3 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 20 case distinctions, treesize of input 760 treesize of output 741 [2022-11-22 02:38:53,276 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:38:53,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:38:53,287 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:38:53,313 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:38:53,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-22 02:38:53,337 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:38:53,338 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-22 02:38:53,354 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:38:53,360 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-11-22 02:38:53,367 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:38:53,492 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-11-22 02:38:53,493 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 195 treesize of output 173 [2022-11-22 02:38:53,568 INFO L321 Elim1Store]: treesize reduction 60, result has 39.4 percent of original size [2022-11-22 02:38:53,569 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 151 treesize of output 162 [2022-11-22 02:38:53,644 INFO L321 Elim1Store]: treesize reduction 44, result has 41.3 percent of original size [2022-11-22 02:38:53,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 135 treesize of output 145 [2022-11-22 02:38:53,864 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:38:53,869 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:38:53,873 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:38:53,906 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:38:53,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-11-22 02:38:53,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2022-11-22 02:38:53,966 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-11-22 02:38:53,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-11-22 02:38:53,992 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-22 02:38:53,992 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-22 02:38:54,018 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:38:54,023 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2022-11-22 02:38:54,028 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-11-22 02:38:54,037 INFO L180 IcfgInterpreter]: Interpretation finished [2022-11-22 02:38:54,799 INFO L133 SifaRunner]: Sifa could not show that error location is unreachable, found '4303#(and (= |ULTIMATE.start_main_~state~0#1| 1) (<= (+ |ULTIMATE.start_main_~head~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~head~0#1.base|)) (= |ULTIMATE.start_main_~x~0#1.offset| 0) (exists ((|v_ULTIMATE.start_main_~x~0#1.base_85| Int) (|v_ULTIMATE.start_main_~x~0#1.offset_71| Int)) (and (<= (+ 8 |v_ULTIMATE.start_main_~x~0#1.offset_71|) (select |#length| |v_ULTIMATE.start_main_~x~0#1.base_85|)) (= (select |#valid| |v_ULTIMATE.start_main_~x~0#1.base_85|) 1) (= (select (select |#memory_int| |v_ULTIMATE.start_main_~x~0#1.base_85|) (+ 4 |v_ULTIMATE.start_main_~x~0#1.offset_71|)) |ULTIMATE.start_main_~state~0#1|) (<= 0 |v_ULTIMATE.start_main_~x~0#1.offset_71|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|) |ULTIMATE.start_main_~x~0#1.offset|) (= |ULTIMATE.start_main_~x~0#1.base| 0) (= |ULTIMATE.start_main_~head~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~head~0#1.base|) 1) (= |#NULL.offset| 0) (= |ULTIMATE.start_main_~x~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~head~0#1.base|) |ULTIMATE.start_main_~head~0#1.offset|)) (<= 0 |#StackHeapBarrier|) (= |#NULL.base| 0))' at error location [2022-11-22 02:38:54,799 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: ALGORITHM_FAILED [2022-11-22 02:38:54,800 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-22 02:38:54,800 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2022-11-22 02:38:54,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275598229] [2022-11-22 02:38:54,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-22 02:38:54,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-11-22 02:38:54,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:54,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-11-22 02:38:54,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=110, Invalid=881, Unknown=5, NotChecked=60, Total=1056 [2022-11-22 02:38:54,801 INFO L87 Difference]: Start difference. First operand 110 states and 129 transitions. Second operand has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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 02:38:55,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:55,737 INFO L93 Difference]: Finished difference Result 213 states and 234 transitions. [2022-11-22 02:38:55,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-11-22 02:38:55,738 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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 18 [2022-11-22 02:38:55,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:55,739 INFO L225 Difference]: With dead ends: 213 [2022-11-22 02:38:55,739 INFO L226 Difference]: Without dead ends: 213 [2022-11-22 02:38:55,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 373 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=208, Invalid=1424, Unknown=12, NotChecked=78, Total=1722 [2022-11-22 02:38:55,740 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 360 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 725 mSolverCounterSat, 26 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 360 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 888 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 725 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 134 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:55,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [360 Valid, 537 Invalid, 888 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 725 Invalid, 3 Unknown, 134 Unchecked, 0.6s Time] [2022-11-22 02:38:55,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-11-22 02:38:55,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 128. [2022-11-22 02:38:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 108 states have (on average 1.3888888888888888) internal successors, (150), 127 states have internal predecessors, (150), 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 02:38:55,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 150 transitions. [2022-11-22 02:38:55,746 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 150 transitions. Word has length 18 [2022-11-22 02:38:55,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:55,746 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 150 transitions. [2022-11-22 02:38:55,747 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 2.3333333333333335) internal successors, (49), 21 states have internal predecessors, (49), 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 02:38:55,747 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 150 transitions. [2022-11-22 02:38:55,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:38:55,748 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:55,748 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:55,758 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-11-22 02:38:55,954 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-22 02:38:55,954 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:55,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:55,955 INFO L85 PathProgramCache]: Analyzing trace with hash 1031178538, now seen corresponding path program 1 times [2022-11-22 02:38:55,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:55,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63778140] [2022-11-22 02:38:55,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:55,956 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:55,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-22 02:38:56,351 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-22 02:38:56,352 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2022-11-22 02:38:56,352 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63778140] [2022-11-22 02:38:56,352 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63778140] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-22 02:38:56,352 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-22 02:38:56,352 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-11-22 02:38:56,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [874410276] [2022-11-22 02:38:56,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-22 02:38:56,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-11-22 02:38:56,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2022-11-22 02:38:56,355 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-11-22 02:38:56,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-11-22 02:38:56,356 INFO L87 Difference]: Start difference. First operand 128 states and 150 transitions. Second operand has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 02:38:56,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-11-22 02:38:56,659 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-11-22 02:38:56,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-22 02:38:56,659 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 19 [2022-11-22 02:38:56,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-11-22 02:38:56,660 INFO L225 Difference]: With dead ends: 130 [2022-11-22 02:38:56,660 INFO L226 Difference]: Without dead ends: 127 [2022-11-22 02:38:56,661 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=149, Unknown=0, NotChecked=0, Total=210 [2022-11-22 02:38:56,661 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 143 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 221 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 302 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 221 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-11-22 02:38:56,661 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 302 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 221 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-11-22 02:38:56,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-11-22 02:38:56,663 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 115. [2022-11-22 02:38:56,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 95 states have (on average 1.4) internal successors, (133), 114 states have internal predecessors, (133), 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 02:38:56,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 133 transitions. [2022-11-22 02:38:56,664 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 133 transitions. Word has length 19 [2022-11-22 02:38:56,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-11-22 02:38:56,665 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 133 transitions. [2022-11-22 02:38:56,665 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 1.9) internal successors, (19), 9 states have internal predecessors, (19), 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 02:38:56,665 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 133 transitions. [2022-11-22 02:38:56,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-11-22 02:38:56,665 INFO L187 NwaCegarLoop]: Found error trace [2022-11-22 02:38:56,665 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:56,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-11-22 02:38:56,666 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2022-11-22 02:38:56,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-22 02:38:56,666 INFO L85 PathProgramCache]: Analyzing trace with hash -824217396, now seen corresponding path program 1 times [2022-11-22 02:38:56,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2022-11-22 02:38:56,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820945411] [2022-11-22 02:38:56,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-22 02:38:56,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-22 02:38:56,685 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:38:56,685 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-11-22 02:38:56,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-11-22 02:38:56,730 INFO L130 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2022-11-22 02:38:56,730 INFO L359 BasicCegarLoop]: Counterexample is feasible [2022-11-22 02:38:56,731 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_LEAK (45 of 46 remaining) [2022-11-22 02:38:56,733 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 46 remaining) [2022-11-22 02:38:56,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 46 remaining) [2022-11-22 02:38:56,734 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 46 remaining) [2022-11-22 02:38:56,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 46 remaining) [2022-11-22 02:38:56,735 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 46 remaining) [2022-11-22 02:38:56,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 46 remaining) [2022-11-22 02:38:56,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 46 remaining) [2022-11-22 02:38:56,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 46 remaining) [2022-11-22 02:38:56,736 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 46 remaining) [2022-11-22 02:38:56,737 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 46 remaining) [2022-11-22 02:38:56,738 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 46 remaining) [2022-11-22 02:38:56,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 46 remaining) [2022-11-22 02:38:56,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_LEAK (32 of 46 remaining) [2022-11-22 02:38:56,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 46 remaining) [2022-11-22 02:38:56,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 46 remaining) [2022-11-22 02:38:56,739 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 46 remaining) [2022-11-22 02:38:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 46 remaining) [2022-11-22 02:38:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK (27 of 46 remaining) [2022-11-22 02:38:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 46 remaining) [2022-11-22 02:38:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 46 remaining) [2022-11-22 02:38:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 46 remaining) [2022-11-22 02:38:56,740 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 46 remaining) [2022-11-22 02:38:56,741 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 46 remaining) [2022-11-22 02:38:56,742 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 46 remaining) [2022-11-22 02:38:56,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 46 remaining) [2022-11-22 02:38:56,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 46 remaining) [2022-11-22 02:38:56,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 46 remaining) [2022-11-22 02:38:56,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 46 remaining) [2022-11-22 02:38:56,743 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 46 remaining) [2022-11-22 02:38:56,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 46 remaining) [2022-11-22 02:38:56,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 46 remaining) [2022-11-22 02:38:56,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 46 remaining) [2022-11-22 02:38:56,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 46 remaining) [2022-11-22 02:38:56,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 46 remaining) [2022-11-22 02:38:56,744 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 46 remaining) [2022-11-22 02:38:56,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 46 remaining) [2022-11-22 02:38:56,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 46 remaining) [2022-11-22 02:38:56,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 46 remaining) [2022-11-22 02:38:56,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE (6 of 46 remaining) [2022-11-22 02:38:56,745 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE (5 of 46 remaining) [2022-11-22 02:38:56,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE (4 of 46 remaining) [2022-11-22 02:38:56,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE (3 of 46 remaining) [2022-11-22 02:38:56,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE (2 of 46 remaining) [2022-11-22 02:38:56,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE (1 of 46 remaining) [2022-11-22 02:38:56,746 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_LEAK (0 of 46 remaining) [2022-11-22 02:38:56,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-11-22 02:38:56,750 INFO L444 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-22 02:38:56,754 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-11-22 02:38:56,798 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 02:38:56 BoogieIcfgContainer [2022-11-22 02:38:56,798 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-11-22 02:38:56,799 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-11-22 02:38:56,799 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-11-22 02:38:56,799 INFO L275 PluginConnector]: Witness Printer initialized [2022-11-22 02:38:56,800 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 02:38:39" (3/4) ... [2022-11-22 02:38:56,802 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2022-11-22 02:38:56,853 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/bin/utaipan-g80aRyZoba/witness.graphml [2022-11-22 02:38:56,854 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-11-22 02:38:56,854 INFO L158 Benchmark]: Toolchain (without parser) took 18543.52ms. Allocated memory was 169.9MB in the beginning and 375.4MB in the end (delta: 205.5MB). Free memory was 123.9MB in the beginning and 212.1MB in the end (delta: -88.2MB). Peak memory consumption was 118.5MB. Max. memory is 16.1GB. [2022-11-22 02:38:56,854 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 134.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:38:56,855 INFO L158 Benchmark]: CACSL2BoogieTranslator took 405.02ms. Allocated memory is still 169.9MB. Free memory was 123.5MB in the beginning and 106.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-11-22 02:38:56,855 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.61ms. Allocated memory is still 169.9MB. Free memory was 105.9MB in the beginning and 104.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2022-11-22 02:38:56,855 INFO L158 Benchmark]: Boogie Preprocessor took 73.09ms. Allocated memory is still 169.9MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:38:56,856 INFO L158 Benchmark]: RCFGBuilder took 753.46ms. Allocated memory is still 169.9MB. Free memory was 102.1MB in the beginning and 125.9MB in the end (delta: -23.8MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. [2022-11-22 02:38:56,856 INFO L158 Benchmark]: TraceAbstraction took 17207.58ms. Allocated memory was 169.9MB in the beginning and 375.4MB in the end (delta: 205.5MB). Free memory was 124.7MB in the beginning and 214.2MB in the end (delta: -89.6MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. [2022-11-22 02:38:56,856 INFO L158 Benchmark]: Witness Printer took 55.01ms. Allocated memory is still 375.4MB. Free memory was 214.2MB in the beginning and 212.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-11-22 02:38:56,858 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.27ms. Allocated memory is still 134.2MB. Free memory is still 75.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 405.02ms. Allocated memory is still 169.9MB. Free memory was 123.5MB in the beginning and 106.3MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.61ms. Allocated memory is still 169.9MB. Free memory was 105.9MB in the beginning and 104.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 73.09ms. Allocated memory is still 169.9MB. Free memory was 104.2MB in the beginning and 102.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 753.46ms. Allocated memory is still 169.9MB. Free memory was 102.1MB in the beginning and 125.9MB in the end (delta: -23.8MB). Peak memory consumption was 16.4MB. Max. memory is 16.1GB. * TraceAbstraction took 17207.58ms. Allocated memory was 169.9MB in the beginning and 375.4MB in the end (delta: 205.5MB). Free memory was 124.7MB in the beginning and 214.2MB in the end (delta: -89.6MB). Peak memory consumption was 114.7MB. Max. memory is 16.1GB. * Witness Printer took 55.01ms. Allocated memory is still 375.4MB. Free memory was 214.2MB in the beginning and 212.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 1032]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L996] SLL* head = malloc(sizeof(SLL)); [L997] head->next = head VAL [head={-1:0}] [L998] head->data = 0 [L1000] SLL* x = head; [L1001] int state = 1; VAL [head={-1:0}, state=1, x={-1:0}] [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1025] x->data = state VAL [head={-1:0}, state=1, x={-1:0}] [L1027] EXPR head->next [L1027] x = head->next [L1028] COND FALSE !(!(((void*)0) != x)) VAL [head={-1:0}, state=1, x={-1:0}] [L1030] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1] [L1030] COND TRUE x->data != 0 [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}] [L1032] EXPR x->next->data [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data != 0 && x->data > x->next->data=1] [L1032] EXPR x->next->data [L1032] EXPR x->next->data != 0 && x->data > x->next->data VAL [head={-1:0}, state=1, x={-1:0}, x->data=1, x->next={-1:0}, x->next={-1:0}, x->next->data=1, x->next->data=1, x->next->data != 0 && x->data > x->next->data=0] [L1032] COND TRUE !(x->next->data != 0 && x->data > x->next->data) [L1032] reach_error() VAL [head={-1:0}, state=1, x={-1:0}] - 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: 1023]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1028]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed 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: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1042]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 993]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 90 locations, 46 error locations. Started 1 CEGAR loops. OverallTime: 17.1s, OverallIterations: 22, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 5.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 3 mSolverCounterUnknown, 3138 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3138 mSDsluCounter, 3538 SdHoareTripleChecker+Invalid, 3.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 134 IncrementalHoareTripleChecker+Unchecked, 2603 mSDsCounter, 239 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3565 IncrementalHoareTripleChecker+Invalid, 3941 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 239 mSolverCounterUnsat, 935 mSDtfsCounter, 3565 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 229 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 178 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 507 ImplicationChecksByTransitivity, 3.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=128occurred in iteration=20, InterpolantAutomatonStates: 156, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 21 MinimizatonAttempts, 529 StatesRemovedByMinimization, 20 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.7s InterpolantComputationTime, 289 NumberOfCodeBlocks, 289 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 265 ConstructedInterpolants, 11 QuantifiedInterpolants, 3394 SizeOfPredicates, 5 NumberOfNonLiveVariables, 182 ConjunctsInSsa, 25 ConjunctsInUnsatCore, 23 InterpolantComputations, 20 PerfectInterpolantSequences, 1/7 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 02:38:56,885 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_a5065875-bf47-4135-b763-a976b91a4f2c/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-memcleanup)