./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/forester-heap/sll-token-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version b2eff8ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/forester-heap/sll-token-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG --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 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup) --- Real Ultimate output --- This is Ultimate 0.2.1-dev-b2eff8b [2021-10-29 05:12:56,412 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-29 05:12:56,415 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-29 05:12:56,459 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-29 05:12:56,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-29 05:12:56,461 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-29 05:12:56,462 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-29 05:12:56,465 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-29 05:12:56,467 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-29 05:12:56,468 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-29 05:12:56,469 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-29 05:12:56,470 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-29 05:12:56,471 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-29 05:12:56,472 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-29 05:12:56,473 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-29 05:12:56,475 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-29 05:12:56,476 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-29 05:12:56,477 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-29 05:12:56,479 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-29 05:12:56,482 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-29 05:12:56,484 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-29 05:12:56,485 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-29 05:12:56,487 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-29 05:12:56,488 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-29 05:12:56,491 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-29 05:12:56,492 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-29 05:12:56,492 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-29 05:12:56,493 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-29 05:12:56,494 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-29 05:12:56,495 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-29 05:12:56,496 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-29 05:12:56,497 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-29 05:12:56,498 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-29 05:12:56,499 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-29 05:12:56,500 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-29 05:12:56,500 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-29 05:12:56,501 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-29 05:12:56,502 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-29 05:12:56,502 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-29 05:12:56,503 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-29 05:12:56,504 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-29 05:12:56,511 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-10-29 05:12:56,558 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-29 05:12:56,562 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-29 05:12:56,563 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-29 05:12:56,563 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-29 05:12:56,564 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-29 05:12:56,564 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-29 05:12:56,564 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-29 05:12:56,564 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-29 05:12:56,565 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-29 05:12:56,565 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-29 05:12:56,566 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-29 05:12:56,566 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-29 05:12:56,567 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-29 05:12:56,567 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-29 05:12:56,567 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-29 05:12:56,568 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-10-29 05:12:56,569 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-10-29 05:12:56,569 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-29 05:12:56,569 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-29 05:12:56,569 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-10-29 05:12:56,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-29 05:12:56,570 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-29 05:12:56,570 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-29 05:12:56,570 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-10-29 05:12:56,571 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-10-29 05:12:56,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-29 05:12:56,572 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-29 05:12:56,573 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-29 05:12:56,573 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-29 05:12:56,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-29 05:12:56,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-29 05:12:56,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:12:56,574 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-29 05:12:56,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-29 05:12:56,575 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-29 05:12:56,575 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-29 05:12:56,575 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-29 05:12:56,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-29 05:12:56,576 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/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_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG 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 -> 10f8c5ed101296da8e76853e36294f37ed1d85898917b59e645db1ac667d60a8 [2021-10-29 05:12:56,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-29 05:12:56,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-29 05:12:56,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-29 05:12:56,899 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-29 05:12:56,900 INFO L275 PluginConnector]: CDTParser initialized [2021-10-29 05:12:56,901 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/../../sv-benchmarks/c/forester-heap/sll-token-1.i [2021-10-29 05:12:56,969 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/data/1365b5094/b9b008f5fd944346a009f4db66eb2c28/FLAGb7bc3c6b8 [2021-10-29 05:12:57,536 INFO L306 CDTParser]: Found 1 translation units. [2021-10-29 05:12:57,536 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i [2021-10-29 05:12:57,550 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/data/1365b5094/b9b008f5fd944346a009f4db66eb2c28/FLAGb7bc3c6b8 [2021-10-29 05:12:57,853 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/data/1365b5094/b9b008f5fd944346a009f4db66eb2c28 [2021-10-29 05:12:57,855 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-29 05:12:57,857 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-29 05:12:57,859 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-29 05:12:57,859 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-29 05:12:57,863 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-29 05:12:57,864 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:12:57" (1/1) ... [2021-10-29 05:12:57,865 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46cad234 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:57, skipping insertion in model container [2021-10-29 05:12:57,865 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.10 05:12:57" (1/1) ... [2021-10-29 05:12:57,873 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-29 05:12:57,917 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-29 05:12:58,297 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2021-10-29 05:12:58,312 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2021-10-29 05:12:58,314 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2021-10-29 05:12:58,317 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2021-10-29 05:12:58,319 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2021-10-29 05:12:58,323 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2021-10-29 05:12:58,334 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:12:58,344 INFO L203 MainTranslator]: Completed pre-run [2021-10-29 05:12:58,404 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22162,22175] [2021-10-29 05:12:58,406 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22311,22324] [2021-10-29 05:12:58,407 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22402,22415] [2021-10-29 05:12:58,408 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22484,22497] [2021-10-29 05:12:58,409 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22562,22575] [2021-10-29 05:12:58,411 WARN L228 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/sv-benchmarks/c/forester-heap/sll-token-1.i[22708,22721] [2021-10-29 05:12:58,413 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-29 05:12:58,450 INFO L208 MainTranslator]: Completed translation [2021-10-29 05:12:58,451 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58 WrapperNode [2021-10-29 05:12:58,451 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-29 05:12:58,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-29 05:12:58,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-29 05:12:58,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-29 05:12:58,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (1/1) ... [2021-10-29 05:12:58,476 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (1/1) ... [2021-10-29 05:12:58,511 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-29 05:12:58,511 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-29 05:12:58,512 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-29 05:12:58,512 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-29 05:12:58,520 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (1/1) ... [2021-10-29 05:12:58,520 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (1/1) ... [2021-10-29 05:12:58,526 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (1/1) ... [2021-10-29 05:12:58,526 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (1/1) ... [2021-10-29 05:12:58,551 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (1/1) ... [2021-10-29 05:12:58,561 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (1/1) ... [2021-10-29 05:12:58,565 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (1/1) ... [2021-10-29 05:12:58,568 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-29 05:12:58,579 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-29 05:12:58,579 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-29 05:12:58,579 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-29 05:12:58,581 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (1/1) ... [2021-10-29 05:12:58,591 INFO L170 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-29 05:12:58,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/z3 [2021-10-29 05:12:58,635 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-10-29 05:12:58,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-10-29 05:12:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-10-29 05:12:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-10-29 05:12:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-29 05:12:58,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-29 05:12:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-29 05:12:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-29 05:12:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-29 05:12:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-29 05:12:58,685 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-29 05:12:58,685 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-29 05:12:59,293 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-29 05:12:59,294 INFO L299 CfgBuilder]: Removed 19 assume(true) statements. [2021-10-29 05:12:59,297 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:12:59 BoogieIcfgContainer [2021-10-29 05:12:59,297 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-29 05:12:59,299 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-29 05:12:59,304 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-29 05:12:59,317 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-29 05:12:59,318 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.10 05:12:57" (1/3) ... [2021-10-29 05:12:59,318 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d172b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:12:59, skipping insertion in model container [2021-10-29 05:12:59,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.10 05:12:58" (2/3) ... [2021-10-29 05:12:59,319 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d172b5a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.10 05:12:59, skipping insertion in model container [2021-10-29 05:12:59,319 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:12:59" (3/3) ... [2021-10-29 05:12:59,321 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-token-1.i [2021-10-29 05:12:59,326 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-29 05:12:59,327 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 54 error locations. [2021-10-29 05:12:59,375 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-10-29 05:12:59,381 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-10-29 05:12:59,382 INFO L340 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2021-10-29 05:12:59,398 INFO L276 IsEmpty]: Start isEmpty. Operand has 108 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 107 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:12:59,403 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-29 05:12:59,403 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:12:59,404 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-10-29 05:12:59,404 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:12:59,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:12:59,411 INFO L85 PathProgramCache]: Analyzing trace with hash 8405, now seen corresponding path program 1 times [2021-10-29 05:12:59,421 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:12:59,422 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1076249678] [2021-10-29 05:12:59,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:12:59,423 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:12:59,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:12:59,707 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:12:59,709 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:12:59,710 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1076249678] [2021-10-29 05:12:59,711 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1076249678] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:12:59,713 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:12:59,713 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 05:12:59,726 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580111455] [2021-10-29 05:12:59,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:12:59,743 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:12:59,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:12:59,766 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:12:59,769 INFO L87 Difference]: Start difference. First operand has 108 states, 53 states have (on average 2.4716981132075473) internal successors, (131), 107 states have internal predecessors, (131), 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) [2021-10-29 05:12:59,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:12:59,977 INFO L93 Difference]: Finished difference Result 126 states and 129 transitions. [2021-10-29 05:12:59,977 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:12:59,979 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 [2021-10-29 05:12:59,979 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:12:59,989 INFO L225 Difference]: With dead ends: 126 [2021-10-29 05:12:59,998 INFO L226 Difference]: Without dead ends: 125 [2021-10-29 05:13:00,000 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:13:00,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2021-10-29 05:13:00,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 105. [2021-10-29 05:13:00,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 53 states have (on average 2.018867924528302) internal successors, (107), 104 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) [2021-10-29 05:13:00,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 107 transitions. [2021-10-29 05:13:00,085 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 107 transitions. Word has length 2 [2021-10-29 05:13:00,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:13:00,086 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 107 transitions. [2021-10-29 05:13:00,090 INFO L471 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) [2021-10-29 05:13:00,091 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 107 transitions. [2021-10-29 05:13:00,091 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2021-10-29 05:13:00,091 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:13:00,092 INFO L513 BasicCegarLoop]: trace histogram [1, 1] [2021-10-29 05:13:00,092 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-29 05:13:00,092 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:13:00,093 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:13:00,093 INFO L85 PathProgramCache]: Analyzing trace with hash 8406, now seen corresponding path program 1 times [2021-10-29 05:13:00,093 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:13:00,094 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1817105409] [2021-10-29 05:13:00,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:13:00,094 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:13:00,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:13:00,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:13:00,161 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:13:00,161 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1817105409] [2021-10-29 05:13:00,161 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1817105409] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:13:00,161 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:13:00,162 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-10-29 05:13:00,162 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514136863] [2021-10-29 05:13:00,163 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-10-29 05:13:00,164 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:13:00,165 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-29 05:13:00,165 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-29 05:13:00,165 INFO L87 Difference]: Start difference. First operand 105 states and 107 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) [2021-10-29 05:13:00,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:13:00,320 INFO L93 Difference]: Finished difference Result 131 states and 133 transitions. [2021-10-29 05:13:00,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-29 05:13:00,323 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 [2021-10-29 05:13:00,323 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:13:00,325 INFO L225 Difference]: With dead ends: 131 [2021-10-29 05:13:00,325 INFO L226 Difference]: Without dead ends: 131 [2021-10-29 05:13:00,326 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:13:00,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2021-10-29 05:13:00,337 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 103. [2021-10-29 05:13:00,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 53 states have (on average 1.9811320754716981) internal successors, (105), 102 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:13:00,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 105 transitions. [2021-10-29 05:13:00,340 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 105 transitions. Word has length 2 [2021-10-29 05:13:00,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:13:00,341 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 105 transitions. [2021-10-29 05:13:00,341 INFO L471 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) [2021-10-29 05:13:00,341 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 105 transitions. [2021-10-29 05:13:00,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 05:13:00,342 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:13:00,342 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-29 05:13:00,342 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-29 05:13:00,343 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:13:00,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:13:00,344 INFO L85 PathProgramCache]: Analyzing trace with hash -821381070, now seen corresponding path program 1 times [2021-10-29 05:13:00,344 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:13:00,345 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1750530674] [2021-10-29 05:13:00,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:13:00,345 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:13:00,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:13:00,427 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:13:00,427 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:13:00,427 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1750530674] [2021-10-29 05:13:00,428 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1750530674] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:13:00,428 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:13:00,428 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:13:00,429 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743380209] [2021-10-29 05:13:00,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:13:00,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:13:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:13:00,435 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:13:00,435 INFO L87 Difference]: Start difference. First operand 103 states and 105 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) [2021-10-29 05:13:00,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:13:00,622 INFO L93 Difference]: Finished difference Result 109 states and 112 transitions. [2021-10-29 05:13:00,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:13:00,623 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 [2021-10-29 05:13:00,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:13:00,626 INFO L225 Difference]: With dead ends: 109 [2021-10-29 05:13:00,626 INFO L226 Difference]: Without dead ends: 109 [2021-10-29 05:13:00,627 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:13:00,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-29 05:13:00,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 92. [2021-10-29 05:13:00,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 55 states have (on average 1.7454545454545454) internal successors, (96), 91 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:13:00,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 96 transitions. [2021-10-29 05:13:00,661 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 96 transitions. Word has length 6 [2021-10-29 05:13:00,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:13:00,662 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 96 transitions. [2021-10-29 05:13:00,662 INFO L471 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) [2021-10-29 05:13:00,662 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 96 transitions. [2021-10-29 05:13:00,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-10-29 05:13:00,664 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:13:00,665 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-10-29 05:13:00,665 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-29 05:13:00,665 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:13:00,666 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:13:00,667 INFO L85 PathProgramCache]: Analyzing trace with hash -821381069, now seen corresponding path program 1 times [2021-10-29 05:13:00,667 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:13:00,668 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912987826] [2021-10-29 05:13:00,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:13:00,669 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:13:00,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:13:00,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:13:00,797 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:13:00,797 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912987826] [2021-10-29 05:13:00,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912987826] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:13:00,798 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:13:00,799 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-29 05:13:00,799 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048257580] [2021-10-29 05:13:00,799 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:13:00,800 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:13:00,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:13:00,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:13:00,802 INFO L87 Difference]: Start difference. First operand 92 states and 96 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) [2021-10-29 05:13:01,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:13:01,004 INFO L93 Difference]: Finished difference Result 166 states and 170 transitions. [2021-10-29 05:13:01,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-29 05:13:01,005 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 [2021-10-29 05:13:01,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:13:01,010 INFO L225 Difference]: With dead ends: 166 [2021-10-29 05:13:01,011 INFO L226 Difference]: Without dead ends: 166 [2021-10-29 05:13:01,011 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:13:01,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2021-10-29 05:13:01,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 119. [2021-10-29 05:13:01,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 82 states have (on average 1.5853658536585367) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:13:01,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2021-10-29 05:13:01,035 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 6 [2021-10-29 05:13:01,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:13:01,036 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2021-10-29 05:13:01,036 INFO L471 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) [2021-10-29 05:13:01,036 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2021-10-29 05:13:01,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 05:13:01,037 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:13:01,038 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:13:01,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-29 05:13:01,039 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:13:01,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:13:01,040 INFO L85 PathProgramCache]: Analyzing trace with hash 927018906, now seen corresponding path program 1 times [2021-10-29 05:13:01,041 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:13:01,041 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268680165] [2021-10-29 05:13:01,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:13:01,041 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:13:01,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:13:01,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:13:01,101 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:13:01,101 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268680165] [2021-10-29 05:13:01,102 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268680165] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:13:01,102 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:13:01,102 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:13:01,102 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951900755] [2021-10-29 05:13:01,103 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:13:01,103 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:13:01,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:13:01,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:13:01,104 INFO L87 Difference]: Start difference. First operand 119 states and 130 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) [2021-10-29 05:13:01,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:13:01,251 INFO L93 Difference]: Finished difference Result 118 states and 129 transitions. [2021-10-29 05:13:01,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:13:01,252 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 [2021-10-29 05:13:01,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:13:01,253 INFO L225 Difference]: With dead ends: 118 [2021-10-29 05:13:01,253 INFO L226 Difference]: Without dead ends: 118 [2021-10-29 05:13:01,254 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:13:01,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2021-10-29 05:13:01,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2021-10-29 05:13:01,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 82 states have (on average 1.5731707317073171) internal successors, (129), 117 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) [2021-10-29 05:13:01,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2021-10-29 05:13:01,261 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 8 [2021-10-29 05:13:01,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:13:01,261 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2021-10-29 05:13:01,261 INFO L471 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) [2021-10-29 05:13:01,262 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2021-10-29 05:13:01,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2021-10-29 05:13:01,262 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:13:01,262 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:13:01,263 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-29 05:13:01,263 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:13:01,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:13:01,263 INFO L85 PathProgramCache]: Analyzing trace with hash 927018907, now seen corresponding path program 1 times [2021-10-29 05:13:01,264 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:13:01,264 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [851607736] [2021-10-29 05:13:01,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:13:01,264 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:13:01,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:13:01,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:13:01,374 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:13:01,374 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [851607736] [2021-10-29 05:13:01,374 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [851607736] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:13:01,375 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:13:01,375 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:13:01,375 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194220198] [2021-10-29 05:13:01,376 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:13:01,376 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:13:01,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:13:01,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:13:01,377 INFO L87 Difference]: Start difference. First operand 118 states and 129 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) [2021-10-29 05:13:01,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:13:01,625 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2021-10-29 05:13:01,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:13:01,626 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 [2021-10-29 05:13:01,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:13:01,627 INFO L225 Difference]: With dead ends: 115 [2021-10-29 05:13:01,627 INFO L226 Difference]: Without dead ends: 115 [2021-10-29 05:13:01,627 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:13:01,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2021-10-29 05:13:01,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 105. [2021-10-29 05:13:01,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 75 states have (on average 1.5333333333333334) internal successors, (115), 104 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:13:01,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 115 transitions. [2021-10-29 05:13:01,633 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 115 transitions. Word has length 8 [2021-10-29 05:13:01,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:13:01,633 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 115 transitions. [2021-10-29 05:13:01,634 INFO L471 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) [2021-10-29 05:13:01,634 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 115 transitions. [2021-10-29 05:13:01,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 05:13:01,634 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:13:01,634 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:13:01,635 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-29 05:13:01,635 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:13:01,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:13:01,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1329117493, now seen corresponding path program 1 times [2021-10-29 05:13:01,636 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:13:01,636 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748176772] [2021-10-29 05:13:01,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:13:01,636 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:13:01,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:13:01,742 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:13:01,742 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:13:01,743 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748176772] [2021-10-29 05:13:01,743 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1748176772] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:13:01,743 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:13:01,743 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:13:01,744 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [309831117] [2021-10-29 05:13:01,744 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:13:01,744 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:13:01,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:13:01,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:13:01,745 INFO L87 Difference]: Start difference. First operand 105 states and 115 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2021-10-29 05:13:01,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:13:01,851 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2021-10-29 05:13:01,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:13:01,852 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 [2021-10-29 05:13:01,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:13:01,853 INFO L225 Difference]: With dead ends: 104 [2021-10-29 05:13:01,853 INFO L226 Difference]: Without dead ends: 104 [2021-10-29 05:13:01,854 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:13:01,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2021-10-29 05:13:01,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2021-10-29 05:13:01,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 75 states have (on average 1.52) internal successors, (114), 103 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:13:01,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 114 transitions. [2021-10-29 05:13:01,864 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 114 transitions. Word has length 9 [2021-10-29 05:13:01,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:13:01,865 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 114 transitions. [2021-10-29 05:13:01,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2021-10-29 05:13:01,865 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 114 transitions. [2021-10-29 05:13:01,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2021-10-29 05:13:01,866 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:13:01,866 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:13:01,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-29 05:13:01,866 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:13:01,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:13:01,867 INFO L85 PathProgramCache]: Analyzing trace with hash -1329117492, now seen corresponding path program 1 times [2021-10-29 05:13:01,867 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:13:01,867 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877968270] [2021-10-29 05:13:01,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:13:01,868 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:13:01,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:13:01,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:13:01,988 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:13:01,988 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877968270] [2021-10-29 05:13:01,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877968270] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:13:01,988 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:13:01,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-10-29 05:13:01,989 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783027598] [2021-10-29 05:13:01,989 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:13:01,989 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:13:01,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:13:01,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:13:01,990 INFO L87 Difference]: Start difference. First operand 104 states and 114 transitions. Second operand has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2021-10-29 05:13:02,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:13:02,092 INFO L93 Difference]: Finished difference Result 103 states and 113 transitions. [2021-10-29 05:13:02,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:13:02,092 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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 [2021-10-29 05:13:02,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:13:02,094 INFO L225 Difference]: With dead ends: 103 [2021-10-29 05:13:02,094 INFO L226 Difference]: Without dead ends: 103 [2021-10-29 05:13:02,094 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-10-29 05:13:02,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-10-29 05:13:02,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2021-10-29 05:13:02,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 75 states have (on average 1.5066666666666666) internal successors, (113), 102 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:13:02,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 113 transitions. [2021-10-29 05:13:02,101 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 113 transitions. Word has length 9 [2021-10-29 05:13:02,101 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:13:02,101 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 113 transitions. [2021-10-29 05:13:02,102 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.25) internal successors, (9), 5 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) [2021-10-29 05:13:02,102 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 113 transitions. [2021-10-29 05:13:02,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2021-10-29 05:13:02,103 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:13:02,103 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:13:02,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-29 05:13:02,107 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:13:02,107 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:13:02,107 INFO L85 PathProgramCache]: Analyzing trace with hash 1806938586, now seen corresponding path program 1 times [2021-10-29 05:13:02,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:13:02,108 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602012399] [2021-10-29 05:13:02,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:13:02,108 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:13:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:13:02,186 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:13:02,188 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:13:02,190 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602012399] [2021-10-29 05:13:02,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [602012399] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:13:02,192 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:13:02,192 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-10-29 05:13:02,192 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550325859] [2021-10-29 05:13:02,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-10-29 05:13:02,193 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:13:02,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-29 05:13:02,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:13:02,194 INFO L87 Difference]: Start difference. First operand 103 states and 113 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2021-10-29 05:13:02,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:13:02,299 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2021-10-29 05:13:02,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-10-29 05:13:02,300 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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 [2021-10-29 05:13:02,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:13:02,301 INFO L225 Difference]: With dead ends: 109 [2021-10-29 05:13:02,301 INFO L226 Difference]: Without dead ends: 109 [2021-10-29 05:13:02,301 INFO L786 BasicCegarLoop]: 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 [2021-10-29 05:13:02,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2021-10-29 05:13:02,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 101. [2021-10-29 05:13:02,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 74 states have (on average 1.5) internal successors, (111), 100 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) [2021-10-29 05:13:02,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2021-10-29 05:13:02,306 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 10 [2021-10-29 05:13:02,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:13:02,306 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2021-10-29 05:13:02,306 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 5 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) [2021-10-29 05:13:02,306 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2021-10-29 05:13:02,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-10-29 05:13:02,307 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:13:02,308 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:13:02,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-29 05:13:02,308 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:13:02,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:13:02,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1676451459, now seen corresponding path program 1 times [2021-10-29 05:13:02,309 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:13:02,309 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101427320] [2021-10-29 05:13:02,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:13:02,309 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:13:02,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-29 05:13:02,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-29 05:13:02,355 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-10-29 05:13:02,355 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101427320] [2021-10-29 05:13:02,355 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101427320] provided 1 perfect and 0 imperfect interpolant sequences [2021-10-29 05:13:02,359 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-29 05:13:02,359 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-29 05:13:02,360 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414245188] [2021-10-29 05:13:02,363 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-10-29 05:13:02,363 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-29 05:13:02,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-29 05:13:02,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-29 05:13:02,365 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:13:02,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-29 05:13:02,461 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2021-10-29 05:13:02,461 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-29 05:13:02,461 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2021-10-29 05:13:02,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-29 05:13:02,463 INFO L225 Difference]: With dead ends: 150 [2021-10-29 05:13:02,463 INFO L226 Difference]: Without dead ends: 150 [2021-10-29 05:13:02,463 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-29 05:13:02,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2021-10-29 05:13:02,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 99. [2021-10-29 05:13:02,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.4931506849315068) internal successors, (109), 98 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) [2021-10-29 05:13:02,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 109 transitions. [2021-10-29 05:13:02,467 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 109 transitions. Word has length 11 [2021-10-29 05:13:02,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-29 05:13:02,467 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 109 transitions. [2021-10-29 05:13:02,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-10-29 05:13:02,468 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 109 transitions. [2021-10-29 05:13:02,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2021-10-29 05:13:02,469 INFO L505 BasicCegarLoop]: Found error trace [2021-10-29 05:13:02,469 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:13:02,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-29 05:13:02,470 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 50 more)] === [2021-10-29 05:13:02,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-29 05:13:02,470 INFO L85 PathProgramCache]: Analyzing trace with hash 935207482, now seen corresponding path program 1 times [2021-10-29 05:13:02,474 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-29 05:13:02,474 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [362876068] [2021-10-29 05:13:02,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-29 05:13:02,475 INFO L128 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-10-29 05:13:02,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:13:02,506 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-29 05:13:02,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-29 05:13:02,575 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-29 05:13:02,575 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-10-29 05:13:02,576 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 05:13:02,578 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-10-29 05:13:02,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-10-29 05:13:02,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-10-29 05:13:02,579 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-10-29 05:13:02,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-10-29 05:13:02,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-10-29 05:13:02,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-10-29 05:13:02,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-10-29 05:13:02,580 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION [2021-10-29 05:13:02,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-10-29 05:13:02,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 05:13:02,581 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION [2021-10-29 05:13:02,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-10-29 05:13:02,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-10-29 05:13:02,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION [2021-10-29 05:13:02,582 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-10-29 05:13:02,584 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-10-29 05:13:02,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION [2021-10-29 05:13:02,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-10-29 05:13:02,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 05:13:02,585 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-10-29 05:13:02,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-10-29 05:13:02,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION [2021-10-29 05:13:02,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-10-29 05:13:02,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 05:13:02,586 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION [2021-10-29 05:13:02,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-10-29 05:13:02,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-10-29 05:13:02,587 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION [2021-10-29 05:13:02,588 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-10-29 05:13:02,589 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION [2021-10-29 05:13:02,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-10-29 05:13:02,591 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-10-29 05:13:02,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 05:13:02,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-10-29 05:13:02,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION [2021-10-29 05:13:02,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-10-29 05:13:02,592 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-10-29 05:13:02,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 05:13:02,593 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 05:13:02,594 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 05:13:02,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-10-29 05:13:02,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-10-29 05:13:02,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 05:13:02,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-10-29 05:13:02,595 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-10-29 05:13:02,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 05:13:02,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 05:13:02,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 05:13:02,596 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 05:13:02,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 05:13:02,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52ASSERT_VIOLATIONMEMORY_FREE [2021-10-29 05:13:02,597 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53ASSERT_VIOLATIONMEMORY_LEAK [2021-10-29 05:13:02,597 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-10-29 05:13:02,601 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-29 05:13:02,605 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-10-29 05:13:02,635 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.10 05:13:02 BoogieIcfgContainer [2021-10-29 05:13:02,636 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-29 05:13:02,636 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-29 05:13:02,636 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-29 05:13:02,636 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-29 05:13:02,636 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.10 05:12:59" (3/4) ... [2021-10-29 05:13:02,638 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-29 05:13:02,670 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/witness.graphml [2021-10-29 05:13:02,670 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-29 05:13:02,671 INFO L168 Benchmark]: Toolchain (without parser) took 4813.54 ms. Allocated memory was 119.5 MB in the beginning and 151.0 MB in the end (delta: 31.5 MB). Free memory was 78.6 MB in the beginning and 55.2 MB in the end (delta: 23.4 MB). Peak memory consumption was 52.8 MB. Max. memory is 16.1 GB. [2021-10-29 05:13:02,672 INFO L168 Benchmark]: CDTParser took 0.24 ms. Allocated memory is still 119.5 MB. Free memory is still 96.6 MB. There was no memory consumed. Max. memory is 16.1 GB. [2021-10-29 05:13:02,672 INFO L168 Benchmark]: CACSL2BoogieTranslator took 592.84 ms. Allocated memory is still 119.5 MB. Free memory was 78.4 MB in the beginning and 85.2 MB in the end (delta: -6.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2021-10-29 05:13:02,673 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.79 ms. Allocated memory is still 119.5 MB. Free memory was 85.2 MB in the beginning and 83.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:13:02,673 INFO L168 Benchmark]: Boogie Preprocessor took 57.05 ms. Allocated memory is still 119.5 MB. Free memory was 83.6 MB in the beginning and 81.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:13:02,673 INFO L168 Benchmark]: RCFGBuilder took 718.16 ms. Allocated memory is still 119.5 MB. Free memory was 81.5 MB in the beginning and 60.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. [2021-10-29 05:13:02,674 INFO L168 Benchmark]: TraceAbstraction took 3336.92 ms. Allocated memory was 119.5 MB in the beginning and 151.0 MB in the end (delta: 31.5 MB). Free memory was 60.1 MB in the beginning and 57.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 34.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:13:02,674 INFO L168 Benchmark]: Witness Printer took 34.16 ms. Allocated memory is still 151.0 MB. Free memory was 57.3 MB in the beginning and 55.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-29 05:13:02,676 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.24 ms. Allocated memory is still 119.5 MB. Free memory is still 96.6 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 592.84 ms. Allocated memory is still 119.5 MB. Free memory was 78.4 MB in the beginning and 85.2 MB in the end (delta: -6.8 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 57.79 ms. Allocated memory is still 119.5 MB. Free memory was 85.2 MB in the beginning and 83.6 MB in the end (delta: 1.7 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 57.05 ms. Allocated memory is still 119.5 MB. Free memory was 83.6 MB in the beginning and 81.5 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 718.16 ms. Allocated memory is still 119.5 MB. Free memory was 81.5 MB in the beginning and 60.5 MB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 16.1 GB. * TraceAbstraction took 3336.92 ms. Allocated memory was 119.5 MB in the beginning and 151.0 MB in the end (delta: 31.5 MB). Free memory was 60.1 MB in the beginning and 57.3 MB in the end (delta: 2.8 MB). Peak memory consumption was 34.1 MB. Max. memory is 16.1 GB. * Witness Printer took 34.16 ms. Allocated memory is still 151.0 MB. Free memory was 57.3 MB in the beginning and 55.2 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.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: 1031]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L1003] SLL* head = malloc(sizeof(SLL)); [L1004] head->next = ((void*)0) [L1005] head->data = 0 [L1007] SLL* x = head; [L1010] COND FALSE !(__VERIFIER_nondet_int()) [L1018] x->data = 1 [L1019] x->next = malloc(sizeof(SLL)) [L1020] EXPR x->next [L1020] x->next->data = 2 [L1022] x = head [L1024] COND FALSE !(!(((void*)0) != x)) [L1026] EXPR x->data [L1026] COND FALSE !(1 != x->data) [L1031] EXPR x->data [L1031] COND TRUE !(2 == x->data) [L1031] reach_error() - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1004]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1005]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1013]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1014]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1015]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1016]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1018]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1019]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1020]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1024]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1026]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1026]: 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 pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1028]: 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: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1029]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1031]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1032]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1033]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1037]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1040]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1041]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1043]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1044]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference 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: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1045]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1000]: 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, 108 locations, 54 error locations. Started 1 CEGAR loops. OverallTime: 3.2s, OverallIterations: 11, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 1.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 656 SDtfs, 711 SDslu, 827 SDs, 0 SdLazy, 1009 SolverSat, 101 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 42 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=119occurred in iteration=4, InterpolantAutomatonStates: 49, 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, 10 MinimizatonAttempts, 181 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 87 NumberOfCodeBlocks, 87 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 61 ConstructedInterpolants, 0 QuantifiedInterpolants, 268 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 10 InterpolantComputations, 10 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2021-10-29 05:13:02,716 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6581880a-97ea-48f1-9cdb-185c9f5a8e43/bin/utaipan-SDwSMHVbGG/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...