./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) Using default analysis Version 9ad7fb26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/config/TaipanMemDerefMemtrack.xml -i ../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH --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 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.2.1-dev-9ad7fb2 [2021-11-03 05:10:26,246 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-11-03 05:10:26,248 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-11-03 05:10:26,299 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-11-03 05:10:26,300 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-11-03 05:10:26,301 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-11-03 05:10:26,304 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-11-03 05:10:26,307 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-11-03 05:10:26,314 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-11-03 05:10:26,316 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-11-03 05:10:26,317 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-11-03 05:10:26,320 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-11-03 05:10:26,322 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-11-03 05:10:26,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-11-03 05:10:26,330 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-11-03 05:10:26,334 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-11-03 05:10:26,338 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-11-03 05:10:26,346 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-11-03 05:10:26,349 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-11-03 05:10:26,352 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-11-03 05:10:26,358 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-11-03 05:10:26,360 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-11-03 05:10:26,362 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-11-03 05:10:26,363 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-11-03 05:10:26,367 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-11-03 05:10:26,368 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-11-03 05:10:26,369 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-11-03 05:10:26,370 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-11-03 05:10:26,371 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-11-03 05:10:26,372 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-11-03 05:10:26,372 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-11-03 05:10:26,374 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-11-03 05:10:26,375 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-11-03 05:10:26,376 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-11-03 05:10:26,378 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-11-03 05:10:26,378 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-11-03 05:10:26,379 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-11-03 05:10:26,380 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-11-03 05:10:26,380 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-11-03 05:10:26,381 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-11-03 05:10:26,382 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-11-03 05:10:26,383 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/config/svcomp-MemCleanup-32bit-Taipan_Default.epf [2021-11-03 05:10:26,415 INFO L113 SettingsManager]: Loading preferences was successful [2021-11-03 05:10:26,416 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-11-03 05:10:26,417 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-11-03 05:10:26,417 INFO L138 SettingsManager]: * User list type=DISABLED [2021-11-03 05:10:26,417 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-11-03 05:10:26,417 INFO L138 SettingsManager]: * Explicit value domain=true [2021-11-03 05:10:26,418 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-11-03 05:10:26,418 INFO L138 SettingsManager]: * Octagon Domain=false [2021-11-03 05:10:26,418 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-11-03 05:10:26,418 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-11-03 05:10:26,419 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-11-03 05:10:26,419 INFO L138 SettingsManager]: * Interval Domain=false [2021-11-03 05:10:26,419 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-11-03 05:10:26,420 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-11-03 05:10:26,420 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-11-03 05:10:26,421 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2021-11-03 05:10:26,427 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2021-11-03 05:10:26,428 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-11-03 05:10:26,428 INFO L138 SettingsManager]: * sizeof long=4 [2021-11-03 05:10:26,428 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2021-11-03 05:10:26,429 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-11-03 05:10:26,429 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-11-03 05:10:26,429 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-11-03 05:10:26,430 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2021-11-03 05:10:26,430 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2021-11-03 05:10:26,430 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-11-03 05:10:26,430 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-11-03 05:10:26,431 INFO L138 SettingsManager]: * sizeof long double=12 [2021-11-03 05:10:26,431 INFO L138 SettingsManager]: * Use constant arrays=true [2021-11-03 05:10:26,431 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-11-03 05:10:26,432 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-11-03 05:10:26,432 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:10:26,432 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-11-03 05:10:26,432 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-11-03 05:10:26,433 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-11-03 05:10:26,433 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-11-03 05:10:26,433 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-11-03 05:10:26,434 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-11-03 05:10:26,434 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_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/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_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2021-11-03 05:10:26,813 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-11-03 05:10:26,857 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-11-03 05:10:26,861 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-11-03 05:10:26,862 INFO L271 PluginConnector]: Initializing CDTParser... [2021-11-03 05:10:26,863 INFO L275 PluginConnector]: CDTParser initialized [2021-11-03 05:10:26,864 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/../../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-11-03 05:10:26,960 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/data/57ea90c68/729731ba7d59421083191214e365489d/FLAG7f67b02d1 [2021-11-03 05:10:27,533 INFO L306 CDTParser]: Found 1 translation units. [2021-11-03 05:10:27,533 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2021-11-03 05:10:27,551 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/data/57ea90c68/729731ba7d59421083191214e365489d/FLAG7f67b02d1 [2021-11-03 05:10:27,816 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/data/57ea90c68/729731ba7d59421083191214e365489d [2021-11-03 05:10:27,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-11-03 05:10:27,820 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-11-03 05:10:27,822 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-11-03 05:10:27,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-11-03 05:10:27,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-11-03 05:10:27,827 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:10:27" (1/1) ... [2021-11-03 05:10:27,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6e792517 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:27, skipping insertion in model container [2021-11-03 05:10:27,829 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.11 05:10:27" (1/1) ... [2021-11-03 05:10:27,837 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-11-03 05:10:27,883 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-11-03 05:10:28,273 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_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-11-03 05:10:28,342 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:10:28,352 INFO L203 MainTranslator]: Completed pre-run [2021-11-03 05:10:28,388 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_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2021-11-03 05:10:28,409 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-11-03 05:10:28,451 INFO L208 MainTranslator]: Completed translation [2021-11-03 05:10:28,452 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28 WrapperNode [2021-11-03 05:10:28,452 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-11-03 05:10:28,453 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-11-03 05:10:28,453 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-11-03 05:10:28,453 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-11-03 05:10:28,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (1/1) ... [2021-11-03 05:10:28,498 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (1/1) ... [2021-11-03 05:10:28,540 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-11-03 05:10:28,541 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-11-03 05:10:28,542 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-11-03 05:10:28,542 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-11-03 05:10:28,552 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (1/1) ... [2021-11-03 05:10:28,552 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (1/1) ... [2021-11-03 05:10:28,560 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (1/1) ... [2021-11-03 05:10:28,560 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (1/1) ... [2021-11-03 05:10:28,578 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (1/1) ... [2021-11-03 05:10:28,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (1/1) ... [2021-11-03 05:10:28,591 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (1/1) ... [2021-11-03 05:10:28,598 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-11-03 05:10:28,599 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-11-03 05:10:28,599 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-11-03 05:10:28,599 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-11-03 05:10:28,600 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (1/1) ... [2021-11-03 05:10:28,622 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-11-03 05:10:28,634 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/z3 [2021-11-03 05:10:28,647 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2021-11-03 05:10:28,653 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2021-11-03 05:10:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2021-11-03 05:10:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2021-11-03 05:10:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-11-03 05:10:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-11-03 05:10:28,691 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-11-03 05:10:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-11-03 05:10:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-11-03 05:10:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-11-03 05:10:28,692 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-11-03 05:10:28,693 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-11-03 05:10:29,935 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-11-03 05:10:29,936 INFO L299 CfgBuilder]: Removed 75 assume(true) statements. [2021-11-03 05:10:29,939 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:10:29 BoogieIcfgContainer [2021-11-03 05:10:29,940 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-11-03 05:10:29,942 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-11-03 05:10:29,942 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-11-03 05:10:29,946 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-11-03 05:10:29,946 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.11 05:10:27" (1/3) ... [2021-11-03 05:10:29,947 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56eef6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:10:29, skipping insertion in model container [2021-11-03 05:10:29,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.11 05:10:28" (2/3) ... [2021-11-03 05:10:29,948 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56eef6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.11 05:10:29, skipping insertion in model container [2021-11-03 05:10:29,948 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:10:29" (3/3) ... [2021-11-03 05:10:29,950 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2021-11-03 05:10:29,957 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-11-03 05:10:29,957 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 131 error locations. [2021-11-03 05:10:30,009 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2021-11-03 05:10:30,016 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2021-11-03 05:10:30,017 INFO L340 AbstractCegarLoop]: Starting to check reachability of 131 error locations. [2021-11-03 05:10:30,041 INFO L276 IsEmpty]: Start isEmpty. Operand has 255 states, 123 states have (on average 2.5284552845528454) internal successors, (311), 254 states have internal predecessors, (311), 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-11-03 05:10:30,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-03 05:10:30,048 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:30,049 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-03 05:10:30,049 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:30,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:30,056 INFO L85 PathProgramCache]: Analyzing trace with hash 19122463, now seen corresponding path program 1 times [2021-11-03 05:10:30,067 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:30,068 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40624342] [2021-11-03 05:10:30,068 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:30,069 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:30,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:30,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:30,261 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:30,261 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40624342] [2021-11-03 05:10:30,262 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40624342] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:30,262 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:30,263 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:10:30,265 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557072916] [2021-11-03 05:10:30,271 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:10:30,271 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:30,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:10:30,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:30,292 INFO L87 Difference]: Start difference. First operand has 255 states, 123 states have (on average 2.5284552845528454) internal successors, (311), 254 states have internal predecessors, (311), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:30,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:30,804 INFO L93 Difference]: Finished difference Result 473 states and 496 transitions. [2021-11-03 05:10:30,804 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:10:30,805 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-03 05:10:30,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:30,820 INFO L225 Difference]: With dead ends: 473 [2021-11-03 05:10:30,820 INFO L226 Difference]: Without dead ends: 471 [2021-11-03 05:10:30,821 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:30,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 471 states. [2021-11-03 05:10:30,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 471 to 252. [2021-11-03 05:10:30,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 123 states have (on average 2.1463414634146343) internal successors, (264), 251 states have internal predecessors, (264), 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-11-03 05:10:30,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-11-03 05:10:30,876 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 4 [2021-11-03 05:10:30,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:30,876 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-11-03 05:10:30,877 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:30,877 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-11-03 05:10:30,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2021-11-03 05:10:30,877 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:30,878 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2021-11-03 05:10:30,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-11-03 05:10:30,878 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:30,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:30,879 INFO L85 PathProgramCache]: Analyzing trace with hash 19122464, now seen corresponding path program 1 times [2021-11-03 05:10:30,879 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:30,880 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598558880] [2021-11-03 05:10:30,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:30,880 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:30,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:30,934 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:30,935 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:30,935 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598558880] [2021-11-03 05:10:30,935 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [598558880] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:30,935 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:30,936 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:10:30,936 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864997094] [2021-11-03 05:10:30,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:10:30,937 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:30,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:10:30,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:30,939 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:31,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:31,190 INFO L93 Difference]: Finished difference Result 397 states and 416 transitions. [2021-11-03 05:10:31,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:10:31,191 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2021-11-03 05:10:31,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:31,195 INFO L225 Difference]: With dead ends: 397 [2021-11-03 05:10:31,195 INFO L226 Difference]: Without dead ends: 397 [2021-11-03 05:10:31,196 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:31,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2021-11-03 05:10:31,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 250. [2021-11-03 05:10:31,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 123 states have (on average 2.130081300813008) internal successors, (262), 249 states have internal predecessors, (262), 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-11-03 05:10:31,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 262 transitions. [2021-11-03 05:10:31,212 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 262 transitions. Word has length 4 [2021-11-03 05:10:31,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:31,212 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 262 transitions. [2021-11-03 05:10:31,213 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:31,213 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 262 transitions. [2021-11-03 05:10:31,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2021-11-03 05:10:31,214 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:31,214 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2021-11-03 05:10:31,214 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-11-03 05:10:31,214 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:31,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:31,215 INFO L85 PathProgramCache]: Analyzing trace with hash 592197104, now seen corresponding path program 1 times [2021-11-03 05:10:31,216 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:31,216 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1247057941] [2021-11-03 05:10:31,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:31,216 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:31,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:31,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:31,245 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:31,245 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1247057941] [2021-11-03 05:10:31,246 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1247057941] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:31,246 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:31,246 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2021-11-03 05:10:31,246 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675997186] [2021-11-03 05:10:31,247 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:10:31,247 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:31,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:10:31,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:31,249 INFO L87 Difference]: Start difference. First operand 250 states and 262 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:31,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:31,468 INFO L93 Difference]: Finished difference Result 386 states and 404 transitions. [2021-11-03 05:10:31,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:10:31,469 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2021-11-03 05:10:31,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:31,472 INFO L225 Difference]: With dead ends: 386 [2021-11-03 05:10:31,472 INFO L226 Difference]: Without dead ends: 385 [2021-11-03 05:10:31,472 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-11-03 05:10:31,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 385 states. [2021-11-03 05:10:31,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 385 to 253. [2021-11-03 05:10:31,505 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 126 states have (on average 2.111111111111111) internal successors, (266), 252 states have internal predecessors, (266), 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-11-03 05:10:31,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 266 transitions. [2021-11-03 05:10:31,507 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 266 transitions. Word has length 5 [2021-11-03 05:10:31,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:31,508 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 266 transitions. [2021-11-03 05:10:31,508 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:31,508 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 266 transitions. [2021-11-03 05:10:31,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:10:31,509 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:31,509 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:10:31,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-11-03 05:10:31,509 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:31,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:31,510 INFO L85 PathProgramCache]: Analyzing trace with hash 1178226029, now seen corresponding path program 1 times [2021-11-03 05:10:31,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:31,511 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934748015] [2021-11-03 05:10:31,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:31,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:31,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:31,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:31,570 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:31,571 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934748015] [2021-11-03 05:10:31,576 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934748015] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:31,576 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:31,576 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:10:31,577 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2115982585] [2021-11-03 05:10:31,577 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:10:31,577 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:31,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:10:31,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:31,579 INFO L87 Difference]: Start difference. First operand 253 states and 266 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-11-03 05:10:31,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:31,604 INFO L93 Difference]: Finished difference Result 263 states and 274 transitions. [2021-11-03 05:10:31,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:10:31,605 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-11-03 05:10:31,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:31,607 INFO L225 Difference]: With dead ends: 263 [2021-11-03 05:10:31,607 INFO L226 Difference]: Without dead ends: 262 [2021-11-03 05:10:31,608 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:31,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 262 states. [2021-11-03 05:10:31,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 262 to 252. [2021-11-03 05:10:31,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 125 states have (on average 2.112) internal successors, (264), 251 states have internal predecessors, (264), 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-11-03 05:10:31,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 264 transitions. [2021-11-03 05:10:31,615 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 264 transitions. Word has length 6 [2021-11-03 05:10:31,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:31,616 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 264 transitions. [2021-11-03 05:10:31,616 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 2 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-11-03 05:10:31,616 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 264 transitions. [2021-11-03 05:10:31,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:10:31,617 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:31,617 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:10:31,617 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-11-03 05:10:31,618 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:31,618 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:31,618 INFO L85 PathProgramCache]: Analyzing trace with hash 1197398764, now seen corresponding path program 1 times [2021-11-03 05:10:31,619 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:31,619 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974887936] [2021-11-03 05:10:31,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:31,619 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:31,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:31,687 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:31,688 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:31,688 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974887936] [2021-11-03 05:10:31,688 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974887936] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:31,689 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:31,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:10:31,689 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [77045274] [2021-11-03 05:10:31,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:10:31,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:31,692 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:10:31,692 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:31,693 INFO L87 Difference]: Start difference. First operand 252 states and 264 transitions. Second operand has 3 states, 2 states have (on average 3.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-11-03 05:10:31,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:31,932 INFO L93 Difference]: Finished difference Result 401 states and 421 transitions. [2021-11-03 05:10:31,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:10:31,933 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-03 05:10:31,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:31,935 INFO L225 Difference]: With dead ends: 401 [2021-11-03 05:10:31,935 INFO L226 Difference]: Without dead ends: 401 [2021-11-03 05:10:31,936 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:31,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 401 states. [2021-11-03 05:10:31,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 401 to 250. [2021-11-03 05:10:31,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 125 states have (on average 2.096) internal successors, (262), 249 states have internal predecessors, (262), 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-11-03 05:10:31,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 262 transitions. [2021-11-03 05:10:31,942 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 262 transitions. Word has length 6 [2021-11-03 05:10:31,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:31,943 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 262 transitions. [2021-11-03 05:10:31,943 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-03 05:10:31,943 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 262 transitions. [2021-11-03 05:10:31,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2021-11-03 05:10:31,944 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:31,944 INFO L513 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2021-11-03 05:10:31,944 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-11-03 05:10:31,944 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:31,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:31,945 INFO L85 PathProgramCache]: Analyzing trace with hash 1197398765, now seen corresponding path program 1 times [2021-11-03 05:10:31,945 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:31,945 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398417589] [2021-11-03 05:10:31,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:31,946 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:31,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:31,985 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:31,985 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:31,985 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398417589] [2021-11-03 05:10:31,985 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398417589] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:31,986 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:31,986 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-11-03 05:10:31,986 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491082795] [2021-11-03 05:10:31,986 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2021-11-03 05:10:31,987 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:31,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-11-03 05:10:31,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:31,988 INFO L87 Difference]: Start difference. First operand 250 states and 262 transitions. Second operand has 3 states, 2 states have (on average 3.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-11-03 05:10:32,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:32,163 INFO L93 Difference]: Finished difference Result 327 states and 343 transitions. [2021-11-03 05:10:32,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-11-03 05:10:32,163 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-03 05:10:32,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:32,165 INFO L225 Difference]: With dead ends: 327 [2021-11-03 05:10:32,166 INFO L226 Difference]: Without dead ends: 327 [2021-11-03 05:10:32,166 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-11-03 05:10:32,167 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 327 states. [2021-11-03 05:10:32,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 327 to 248. [2021-11-03 05:10:32,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 125 states have (on average 2.08) internal successors, (260), 247 states have internal predecessors, (260), 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-11-03 05:10:32,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 260 transitions. [2021-11-03 05:10:32,172 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 260 transitions. Word has length 6 [2021-11-03 05:10:32,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:32,173 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 260 transitions. [2021-11-03 05:10:32,173 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-11-03 05:10:32,173 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 260 transitions. [2021-11-03 05:10:32,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2021-11-03 05:10:32,174 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:32,174 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:32,174 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-11-03 05:10:32,174 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:32,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:32,175 INFO L85 PathProgramCache]: Analyzing trace with hash 1465193814, now seen corresponding path program 1 times [2021-11-03 05:10:32,175 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:32,175 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1726885904] [2021-11-03 05:10:32,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:32,176 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:32,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:32,228 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:32,229 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:32,229 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1726885904] [2021-11-03 05:10:32,229 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1726885904] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:32,229 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:32,229 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:10:32,230 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1007243298] [2021-11-03 05:10:32,230 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2021-11-03 05:10:32,230 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:32,231 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-11-03 05:10:32,231 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-11-03 05:10:32,231 INFO L87 Difference]: Start difference. First operand 248 states and 260 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-11-03 05:10:32,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:32,280 INFO L93 Difference]: Finished difference Result 422 states and 443 transitions. [2021-11-03 05:10:32,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-11-03 05:10:32,281 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-11-03 05:10:32,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:32,284 INFO L225 Difference]: With dead ends: 422 [2021-11-03 05:10:32,284 INFO L226 Difference]: Without dead ends: 422 [2021-11-03 05:10:32,284 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:10:32,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 422 states. [2021-11-03 05:10:32,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 422 to 248. [2021-11-03 05:10:32,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 125 states have (on average 2.072) internal successors, (259), 247 states have internal predecessors, (259), 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-11-03 05:10:32,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 259 transitions. [2021-11-03 05:10:32,291 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 259 transitions. Word has length 11 [2021-11-03 05:10:32,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:32,291 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 259 transitions. [2021-11-03 05:10:32,291 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 4 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-11-03 05:10:32,291 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 259 transitions. [2021-11-03 05:10:32,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-11-03 05:10:32,292 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:32,292 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:32,292 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-11-03 05:10:32,293 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:32,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:32,293 INFO L85 PathProgramCache]: Analyzing trace with hash -1823647033, now seen corresponding path program 1 times [2021-11-03 05:10:32,293 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:32,293 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876746941] [2021-11-03 05:10:32,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:32,294 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:32,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:32,341 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:32,341 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:32,341 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876746941] [2021-11-03 05:10:32,341 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876746941] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:32,342 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:32,342 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:10:32,342 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360538624] [2021-11-03 05:10:32,342 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:10:32,342 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:32,343 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:10:32,343 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:10:32,343 INFO L87 Difference]: Start difference. First operand 248 states and 259 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:32,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:32,508 INFO L93 Difference]: Finished difference Result 820 states and 861 transitions. [2021-11-03 05:10:32,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:10:32,509 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2021-11-03 05:10:32,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:32,513 INFO L225 Difference]: With dead ends: 820 [2021-11-03 05:10:32,514 INFO L226 Difference]: Without dead ends: 820 [2021-11-03 05:10:32,514 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:10:32,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 820 states. [2021-11-03 05:10:32,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 820 to 250. [2021-11-03 05:10:32,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 128 states have (on average 2.0625) internal successors, (264), 249 states have internal predecessors, (264), 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-11-03 05:10:32,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 264 transitions. [2021-11-03 05:10:32,523 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 264 transitions. Word has length 12 [2021-11-03 05:10:32,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:32,523 INFO L470 AbstractCegarLoop]: Abstraction has 250 states and 264 transitions. [2021-11-03 05:10:32,524 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:32,524 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 264 transitions. [2021-11-03 05:10:32,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 05:10:32,524 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:32,524 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:32,525 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-11-03 05:10:32,525 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:32,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:32,525 INFO L85 PathProgramCache]: Analyzing trace with hash -698477090, now seen corresponding path program 1 times [2021-11-03 05:10:32,526 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:32,526 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825134958] [2021-11-03 05:10:32,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:32,526 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:32,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:32,568 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:32,569 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:32,569 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825134958] [2021-11-03 05:10:32,569 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825134958] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:32,569 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:32,569 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:10:32,570 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93691796] [2021-11-03 05:10:32,570 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:10:32,570 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:32,571 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:10:32,571 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:10:32,571 INFO L87 Difference]: Start difference. First operand 250 states and 264 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:33,093 INFO L93 Difference]: Finished difference Result 490 states and 518 transitions. [2021-11-03 05:10:33,093 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2021-11-03 05:10:33,093 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 05:10:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:33,096 INFO L225 Difference]: With dead ends: 490 [2021-11-03 05:10:33,096 INFO L226 Difference]: Without dead ends: 490 [2021-11-03 05:10:33,096 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:10:33,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2021-11-03 05:10:33,102 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 242. [2021-11-03 05:10:33,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 242 states, 129 states have (on average 1.9844961240310077) internal successors, (256), 241 states have internal predecessors, (256), 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-11-03 05:10:33,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 242 states to 242 states and 256 transitions. [2021-11-03 05:10:33,104 INFO L78 Accepts]: Start accepts. Automaton has 242 states and 256 transitions. Word has length 13 [2021-11-03 05:10:33,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:33,105 INFO L470 AbstractCegarLoop]: Abstraction has 242 states and 256 transitions. [2021-11-03 05:10:33,105 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:33,105 INFO L276 IsEmpty]: Start isEmpty. Operand 242 states and 256 transitions. [2021-11-03 05:10:33,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-11-03 05:10:33,105 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:33,106 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:33,106 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-11-03 05:10:33,106 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:33,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:33,107 INFO L85 PathProgramCache]: Analyzing trace with hash -698477089, now seen corresponding path program 1 times [2021-11-03 05:10:33,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:33,107 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974033275] [2021-11-03 05:10:33,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:33,107 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:33,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:33,167 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:33,168 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:33,168 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974033275] [2021-11-03 05:10:33,168 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974033275] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:33,168 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:33,168 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2021-11-03 05:10:33,169 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506802278] [2021-11-03 05:10:33,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:10:33,169 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:33,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:10:33,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:10:33,170 INFO L87 Difference]: Start difference. First operand 242 states and 256 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:33,578 INFO L93 Difference]: Finished difference Result 576 states and 604 transitions. [2021-11-03 05:10:33,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2021-11-03 05:10:33,579 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2021-11-03 05:10:33,579 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:33,583 INFO L225 Difference]: With dead ends: 576 [2021-11-03 05:10:33,583 INFO L226 Difference]: Without dead ends: 576 [2021-11-03 05:10:33,583 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:10:33,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-11-03 05:10:33,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 282. [2021-11-03 05:10:33,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 169 states have (on average 1.8875739644970415) internal successors, (319), 281 states have internal predecessors, (319), 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-11-03 05:10:33,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 319 transitions. [2021-11-03 05:10:33,593 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 319 transitions. Word has length 13 [2021-11-03 05:10:33,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:33,593 INFO L470 AbstractCegarLoop]: Abstraction has 282 states and 319 transitions. [2021-11-03 05:10:33,593 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:33,593 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 319 transitions. [2021-11-03 05:10:33,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-03 05:10:33,594 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:33,594 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:33,594 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-11-03 05:10:33,594 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:33,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:33,595 INFO L85 PathProgramCache]: Analyzing trace with hash 804274739, now seen corresponding path program 1 times [2021-11-03 05:10:33,595 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:33,595 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972911452] [2021-11-03 05:10:33,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:33,596 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:33,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:33,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:10:33,673 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:33,673 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972911452] [2021-11-03 05:10:33,673 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1972911452] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:33,673 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:33,673 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:10:33,674 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495132401] [2021-11-03 05:10:33,674 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:10:33,674 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:33,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:10:33,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:10:33,675 INFO L87 Difference]: Start difference. First operand 282 states and 319 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:33,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:33,868 INFO L93 Difference]: Finished difference Result 358 states and 398 transitions. [2021-11-03 05:10:33,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:10:33,869 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-03 05:10:33,869 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:33,871 INFO L225 Difference]: With dead ends: 358 [2021-11-03 05:10:33,871 INFO L226 Difference]: Without dead ends: 358 [2021-11-03 05:10:33,871 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:10:33,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 358 states. [2021-11-03 05:10:33,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 358 to 280. [2021-11-03 05:10:33,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 168 states have (on average 1.880952380952381) internal successors, (316), 279 states have internal predecessors, (316), 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-11-03 05:10:33,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 316 transitions. [2021-11-03 05:10:33,878 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 316 transitions. Word has length 19 [2021-11-03 05:10:33,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:33,879 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 316 transitions. [2021-11-03 05:10:33,879 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:33,879 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 316 transitions. [2021-11-03 05:10:33,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2021-11-03 05:10:33,880 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:33,880 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:33,880 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2021-11-03 05:10:33,880 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:33,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:33,881 INFO L85 PathProgramCache]: Analyzing trace with hash 770874066, now seen corresponding path program 1 times [2021-11-03 05:10:33,881 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:33,882 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [115298364] [2021-11-03 05:10:33,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:33,882 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:33,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:33,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2021-11-03 05:10:33,937 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:33,938 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [115298364] [2021-11-03 05:10:33,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [115298364] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:33,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:33,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2021-11-03 05:10:33,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244491212] [2021-11-03 05:10:33,939 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2021-11-03 05:10:33,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-11-03 05:10:33,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2021-11-03 05:10:33,940 INFO L87 Difference]: Start difference. First operand 280 states and 316 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:34,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:34,105 INFO L93 Difference]: Finished difference Result 278 states and 313 transitions. [2021-11-03 05:10:34,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-11-03 05:10:34,106 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2021-11-03 05:10:34,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:34,108 INFO L225 Difference]: With dead ends: 278 [2021-11-03 05:10:34,108 INFO L226 Difference]: Without dead ends: 278 [2021-11-03 05:10:34,109 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2021-11-03 05:10:34,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 278 states. [2021-11-03 05:10:34,113 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 278 to 278. [2021-11-03 05:10:34,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.874251497005988) internal successors, (313), 277 states have internal predecessors, (313), 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-11-03 05:10:34,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 313 transitions. [2021-11-03 05:10:34,116 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 313 transitions. Word has length 19 [2021-11-03 05:10:34,116 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:34,116 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 313 transitions. [2021-11-03 05:10:34,116 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2021-11-03 05:10:34,117 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 313 transitions. [2021-11-03 05:10:34,117 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-03 05:10:34,117 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:34,118 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:34,118 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2021-11-03 05:10:34,118 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:34,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:34,119 INFO L85 PathProgramCache]: Analyzing trace with hash -1467799738, now seen corresponding path program 1 times [2021-11-03 05:10:34,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:34,119 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724975835] [2021-11-03 05:10:34,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:34,119 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:34,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:34,225 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:34,225 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724975835] [2021-11-03 05:10:34,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724975835] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:34,225 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:34,225 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:10:34,226 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110371446] [2021-11-03 05:10:34,226 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:10:34,226 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:34,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:10:34,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:10:34,227 INFO L87 Difference]: Start difference. First operand 278 states and 313 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-11-03 05:10:34,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:34,557 INFO L93 Difference]: Finished difference Result 576 states and 604 transitions. [2021-11-03 05:10:34,558 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:10:34,558 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 22 [2021-11-03 05:10:34,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:34,561 INFO L225 Difference]: With dead ends: 576 [2021-11-03 05:10:34,562 INFO L226 Difference]: Without dead ends: 576 [2021-11-03 05:10:34,562 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:10:34,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2021-11-03 05:10:34,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 278. [2021-11-03 05:10:34,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.8682634730538923) internal successors, (312), 277 states have internal predecessors, (312), 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-11-03 05:10:34,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 312 transitions. [2021-11-03 05:10:34,571 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 312 transitions. Word has length 22 [2021-11-03 05:10:34,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:34,571 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 312 transitions. [2021-11-03 05:10:34,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-11-03 05:10:34,571 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 312 transitions. [2021-11-03 05:10:34,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2021-11-03 05:10:34,572 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:34,572 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:34,573 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2021-11-03 05:10:34,573 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:34,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:34,573 INFO L85 PathProgramCache]: Analyzing trace with hash -74930744, now seen corresponding path program 1 times [2021-11-03 05:10:34,574 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:34,574 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048163110] [2021-11-03 05:10:34,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:34,574 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:34,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:34,647 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:34,648 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:34,648 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048163110] [2021-11-03 05:10:34,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1048163110] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:34,648 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:34,648 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:10:34,650 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1587443979] [2021-11-03 05:10:34,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:10:34,651 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:34,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:10:34,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:10:34,652 INFO L87 Difference]: Start difference. First operand 278 states and 312 transitions. Second operand has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-11-03 05:10:35,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:35,011 INFO L93 Difference]: Finished difference Result 574 states and 602 transitions. [2021-11-03 05:10:35,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:10:35,011 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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 22 [2021-11-03 05:10:35,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:35,015 INFO L225 Difference]: With dead ends: 574 [2021-11-03 05:10:35,015 INFO L226 Difference]: Without dead ends: 574 [2021-11-03 05:10:35,015 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:10:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2021-11-03 05:10:35,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 278. [2021-11-03 05:10:35,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 278 states, 167 states have (on average 1.8622754491017963) internal successors, (311), 277 states have internal predecessors, (311), 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-11-03 05:10:35,025 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 278 states to 278 states and 311 transitions. [2021-11-03 05:10:35,025 INFO L78 Accepts]: Start accepts. Automaton has 278 states and 311 transitions. Word has length 22 [2021-11-03 05:10:35,025 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:35,025 INFO L470 AbstractCegarLoop]: Abstraction has 278 states and 311 transitions. [2021-11-03 05:10:35,025 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 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-11-03 05:10:35,026 INFO L276 IsEmpty]: Start isEmpty. Operand 278 states and 311 transitions. [2021-11-03 05:10:35,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-03 05:10:35,026 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:35,026 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:35,027 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2021-11-03 05:10:35,027 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:35,027 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:35,027 INFO L85 PathProgramCache]: Analyzing trace with hash -1806081044, now seen corresponding path program 1 times [2021-11-03 05:10:35,027 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:35,027 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536146918] [2021-11-03 05:10:35,028 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:35,028 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:35,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:35,112 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:35,112 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:35,112 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536146918] [2021-11-03 05:10:35,113 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536146918] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:35,113 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:35,113 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:10:35,113 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1068831761] [2021-11-03 05:10:35,113 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:10:35,114 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:35,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:10:35,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:10:35,115 INFO L87 Difference]: Start difference. First operand 278 states and 311 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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-11-03 05:10:35,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:35,816 INFO L93 Difference]: Finished difference Result 670 states and 707 transitions. [2021-11-03 05:10:35,816 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:10:35,816 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 24 [2021-11-03 05:10:35,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:35,820 INFO L225 Difference]: With dead ends: 670 [2021-11-03 05:10:35,820 INFO L226 Difference]: Without dead ends: 670 [2021-11-03 05:10:35,821 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:10:35,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 670 states. [2021-11-03 05:10:35,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 670 to 279. [2021-11-03 05:10:35,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8630952380952381) internal successors, (313), 278 states have internal predecessors, (313), 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-11-03 05:10:35,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 313 transitions. [2021-11-03 05:10:35,830 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 313 transitions. Word has length 24 [2021-11-03 05:10:35,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:35,830 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 313 transitions. [2021-11-03 05:10:35,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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-11-03 05:10:35,830 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 313 transitions. [2021-11-03 05:10:35,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-03 05:10:35,831 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:35,831 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:35,832 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2021-11-03 05:10:35,832 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:35,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:35,832 INFO L85 PathProgramCache]: Analyzing trace with hash -1806081043, now seen corresponding path program 1 times [2021-11-03 05:10:35,832 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:35,833 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45957540] [2021-11-03 05:10:35,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:35,833 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:35,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:35,937 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:35,937 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:35,937 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45957540] [2021-11-03 05:10:35,938 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45957540] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:35,938 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:35,938 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:10:35,938 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649741189] [2021-11-03 05:10:35,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:10:35,939 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:35,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:10:35,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:10:35,939 INFO L87 Difference]: Start difference. First operand 279 states and 313 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-11-03 05:10:36,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:36,626 INFO L93 Difference]: Finished difference Result 635 states and 667 transitions. [2021-11-03 05:10:36,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:10:36,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2021-11-03 05:10:36,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:36,629 INFO L225 Difference]: With dead ends: 635 [2021-11-03 05:10:36,629 INFO L226 Difference]: Without dead ends: 635 [2021-11-03 05:10:36,629 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:10:36,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2021-11-03 05:10:36,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 279. [2021-11-03 05:10:36,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 278 states have internal predecessors, (312), 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-11-03 05:10:36,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 312 transitions. [2021-11-03 05:10:36,638 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 312 transitions. Word has length 24 [2021-11-03 05:10:36,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:36,638 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 312 transitions. [2021-11-03 05:10:36,638 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-11-03 05:10:36,638 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 312 transitions. [2021-11-03 05:10:36,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-03 05:10:36,639 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:36,639 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:36,639 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2021-11-03 05:10:36,639 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:36,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:36,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1006190094, now seen corresponding path program 1 times [2021-11-03 05:10:36,640 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:36,640 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1099583122] [2021-11-03 05:10:36,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:36,640 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:36,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:36,727 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:36,727 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:36,727 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1099583122] [2021-11-03 05:10:36,728 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1099583122] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:36,728 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:36,728 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-11-03 05:10:36,728 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92805086] [2021-11-03 05:10:36,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2021-11-03 05:10:36,729 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:36,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-11-03 05:10:36,730 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-11-03 05:10:36,730 INFO L87 Difference]: Start difference. First operand 279 states and 312 transitions. Second operand has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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-11-03 05:10:37,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:37,385 INFO L93 Difference]: Finished difference Result 668 states and 705 transitions. [2021-11-03 05:10:37,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2021-11-03 05:10:37,385 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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 24 [2021-11-03 05:10:37,385 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:37,389 INFO L225 Difference]: With dead ends: 668 [2021-11-03 05:10:37,389 INFO L226 Difference]: Without dead ends: 668 [2021-11-03 05:10:37,390 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=117, Unknown=0, NotChecked=0, Total=182 [2021-11-03 05:10:37,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 668 states. [2021-11-03 05:10:37,397 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 668 to 279. [2021-11-03 05:10:37,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8511904761904763) internal successors, (311), 278 states have internal predecessors, (311), 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-11-03 05:10:37,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 311 transitions. [2021-11-03 05:10:37,399 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 311 transitions. Word has length 24 [2021-11-03 05:10:37,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:37,399 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 311 transitions. [2021-11-03 05:10:37,399 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 8 states have internal predecessors, (24), 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-11-03 05:10:37,400 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 311 transitions. [2021-11-03 05:10:37,400 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2021-11-03 05:10:37,400 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:37,401 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:37,401 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2021-11-03 05:10:37,401 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:37,401 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:37,402 INFO L85 PathProgramCache]: Analyzing trace with hash 1006190095, now seen corresponding path program 1 times [2021-11-03 05:10:37,402 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:37,402 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104211850] [2021-11-03 05:10:37,402 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:37,402 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:37,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-11-03 05:10:37,512 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-11-03 05:10:37,512 INFO L139 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2021-11-03 05:10:37,512 INFO L332 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104211850] [2021-11-03 05:10:37,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104211850] provided 1 perfect and 0 imperfect interpolant sequences [2021-11-03 05:10:37,513 INFO L186 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-11-03 05:10:37,513 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2021-11-03 05:10:37,513 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986462375] [2021-11-03 05:10:37,513 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2021-11-03 05:10:37,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-11-03 05:10:37,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2021-11-03 05:10:37,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2021-11-03 05:10:37,514 INFO L87 Difference]: Start difference. First operand 279 states and 311 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-11-03 05:10:38,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-11-03 05:10:38,200 INFO L93 Difference]: Finished difference Result 633 states and 665 transitions. [2021-11-03 05:10:38,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2021-11-03 05:10:38,201 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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 24 [2021-11-03 05:10:38,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-11-03 05:10:38,205 INFO L225 Difference]: With dead ends: 633 [2021-11-03 05:10:38,205 INFO L226 Difference]: Without dead ends: 633 [2021-11-03 05:10:38,205 INFO L786 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2021-11-03 05:10:38,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 633 states. [2021-11-03 05:10:38,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 633 to 279. [2021-11-03 05:10:38,214 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 279 states, 168 states have (on average 1.8452380952380953) internal successors, (310), 278 states have internal predecessors, (310), 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-11-03 05:10:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 279 states to 279 states and 310 transitions. [2021-11-03 05:10:38,215 INFO L78 Accepts]: Start accepts. Automaton has 279 states and 310 transitions. Word has length 24 [2021-11-03 05:10:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-11-03 05:10:38,216 INFO L470 AbstractCegarLoop]: Abstraction has 279 states and 310 transitions. [2021-11-03 05:10:38,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 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-11-03 05:10:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 310 transitions. [2021-11-03 05:10:38,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-11-03 05:10:38,219 INFO L505 BasicCegarLoop]: Found error trace [2021-11-03 05:10:38,219 INFO L513 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:38,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2021-11-03 05:10:38,220 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 127 more)] === [2021-11-03 05:10:38,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-11-03 05:10:38,221 INFO L85 PathProgramCache]: Analyzing trace with hash -477088755, now seen corresponding path program 1 times [2021-11-03 05:10:38,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-11-03 05:10:38,221 INFO L332 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873687564] [2021-11-03 05:10:38,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-11-03 05:10:38,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2021-11-03 05:10:38,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 05:10:38,253 INFO L355 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-11-03 05:10:38,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-11-03 05:10:38,326 INFO L133 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-11-03 05:10:38,327 INFO L627 BasicCegarLoop]: Counterexample is feasible [2021-11-03 05:10:38,329 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION [2021-11-03 05:10:38,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION [2021-11-03 05:10:38,331 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION [2021-11-03 05:10:38,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION [2021-11-03 05:10:38,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION [2021-11-03 05:10:38,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION [2021-11-03 05:10:38,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION [2021-11-03 05:10:38,332 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION [2021-11-03 05:10:38,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION [2021-11-03 05:10:38,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION [2021-11-03 05:10:38,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,333 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION [2021-11-03 05:10:38,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION [2021-11-03 05:10:38,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION [2021-11-03 05:10:38,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION [2021-11-03 05:10:38,334 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION [2021-11-03 05:10:38,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION [2021-11-03 05:10:38,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION [2021-11-03 05:10:38,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION [2021-11-03 05:10:38,335 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION [2021-11-03 05:10:38,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION [2021-11-03 05:10:38,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,336 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION [2021-11-03 05:10:38,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION [2021-11-03 05:10:38,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION [2021-11-03 05:10:38,337 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION [2021-11-03 05:10:38,338 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,338 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION [2021-11-03 05:10:38,338 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION [2021-11-03 05:10:38,338 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION [2021-11-03 05:10:38,338 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION [2021-11-03 05:10:38,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION [2021-11-03 05:10:38,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION [2021-11-03 05:10:38,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION [2021-11-03 05:10:38,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION [2021-11-03 05:10:38,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION [2021-11-03 05:10:38,339 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION [2021-11-03 05:10:38,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION [2021-11-03 05:10:38,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION [2021-11-03 05:10:38,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION [2021-11-03 05:10:38,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION [2021-11-03 05:10:38,340 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION [2021-11-03 05:10:38,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION [2021-11-03 05:10:38,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION [2021-11-03 05:10:38,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION [2021-11-03 05:10:38,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION [2021-11-03 05:10:38,341 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION [2021-11-03 05:10:38,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION [2021-11-03 05:10:38,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION [2021-11-03 05:10:38,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION [2021-11-03 05:10:38,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION [2021-11-03 05:10:38,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION [2021-11-03 05:10:38,342 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION [2021-11-03 05:10:38,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION [2021-11-03 05:10:38,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION [2021-11-03 05:10:38,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION [2021-11-03 05:10:38,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION [2021-11-03 05:10:38,343 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION [2021-11-03 05:10:38,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64REQUIRES_VIOLATION [2021-11-03 05:10:38,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65REQUIRES_VIOLATION [2021-11-03 05:10:38,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66REQUIRES_VIOLATION [2021-11-03 05:10:38,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION [2021-11-03 05:10:38,344 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION [2021-11-03 05:10:38,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION [2021-11-03 05:10:38,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION [2021-11-03 05:10:38,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION [2021-11-03 05:10:38,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION [2021-11-03 05:10:38,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION [2021-11-03 05:10:38,345 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION [2021-11-03 05:10:38,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION [2021-11-03 05:10:38,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION [2021-11-03 05:10:38,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION [2021-11-03 05:10:38,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION [2021-11-03 05:10:38,346 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION [2021-11-03 05:10:38,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION [2021-11-03 05:10:38,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81REQUIRES_VIOLATION [2021-11-03 05:10:38,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82REQUIRES_VIOLATION [2021-11-03 05:10:38,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83REQUIRES_VIOLATION [2021-11-03 05:10:38,347 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION [2021-11-03 05:10:38,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION [2021-11-03 05:10:38,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86REQUIRES_VIOLATION [2021-11-03 05:10:38,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87REQUIRES_VIOLATION [2021-11-03 05:10:38,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88REQUIRES_VIOLATION [2021-11-03 05:10:38,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89REQUIRES_VIOLATION [2021-11-03 05:10:38,348 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr90REQUIRES_VIOLATION [2021-11-03 05:10:38,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr91REQUIRES_VIOLATION [2021-11-03 05:10:38,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr92REQUIRES_VIOLATION [2021-11-03 05:10:38,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr93REQUIRES_VIOLATION [2021-11-03 05:10:38,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr94REQUIRES_VIOLATION [2021-11-03 05:10:38,349 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr95REQUIRES_VIOLATION [2021-11-03 05:10:38,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr96REQUIRES_VIOLATION [2021-11-03 05:10:38,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr97REQUIRES_VIOLATION [2021-11-03 05:10:38,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr98REQUIRES_VIOLATION [2021-11-03 05:10:38,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr99REQUIRES_VIOLATION [2021-11-03 05:10:38,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr100REQUIRES_VIOLATION [2021-11-03 05:10:38,350 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr101ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:10:38,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr102ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:10:38,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr103ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:10:38,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr104ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr105REQUIRES_VIOLATION [2021-11-03 05:10:38,351 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr106REQUIRES_VIOLATION [2021-11-03 05:10:38,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr107ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr108REQUIRES_VIOLATION [2021-11-03 05:10:38,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr109REQUIRES_VIOLATION [2021-11-03 05:10:38,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr110ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,352 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr111REQUIRES_VIOLATION [2021-11-03 05:10:38,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr112REQUIRES_VIOLATION [2021-11-03 05:10:38,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr113REQUIRES_VIOLATION [2021-11-03 05:10:38,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr114REQUIRES_VIOLATION [2021-11-03 05:10:38,353 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr115REQUIRES_VIOLATION [2021-11-03 05:10:38,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr116REQUIRES_VIOLATION [2021-11-03 05:10:38,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr117REQUIRES_VIOLATION [2021-11-03 05:10:38,354 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr118REQUIRES_VIOLATION [2021-11-03 05:10:38,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr119ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr120REQUIRES_VIOLATION [2021-11-03 05:10:38,355 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr121REQUIRES_VIOLATION [2021-11-03 05:10:38,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr122ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:10:38,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr123ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:10:38,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr124ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:10:38,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr125REQUIRES_VIOLATION [2021-11-03 05:10:38,356 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr126REQUIRES_VIOLATION [2021-11-03 05:10:38,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr127ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:10:38,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr128ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:10:38,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr129ASSERT_VIOLATIONMEMORY_FREE [2021-11-03 05:10:38,357 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr130ASSERT_VIOLATIONMEMORY_LEAK [2021-11-03 05:10:38,357 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2021-11-03 05:10:38,361 INFO L731 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-11-03 05:10:38,367 INFO L179 ceAbstractionStarter]: Computing trace abstraction results [2021-11-03 05:10:38,431 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.11 05:10:38 BoogieIcfgContainer [2021-11-03 05:10:38,431 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-11-03 05:10:38,432 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-11-03 05:10:38,432 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-11-03 05:10:38,432 INFO L275 PluginConnector]: Witness Printer initialized [2021-11-03 05:10:38,433 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.11 05:10:29" (3/4) ... [2021-11-03 05:10:38,435 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-11-03 05:10:38,496 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/witness.graphml [2021-11-03 05:10:38,497 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-11-03 05:10:38,498 INFO L168 Benchmark]: Toolchain (without parser) took 10676.81 ms. Allocated memory was 94.4 MB in the beginning and 169.9 MB in the end (delta: 75.5 MB). Free memory was 59.0 MB in the beginning and 77.3 MB in the end (delta: -18.3 MB). Peak memory consumption was 55.4 MB. Max. memory is 16.1 GB. [2021-11-03 05:10:38,499 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 94.4 MB. Free memory was 64.5 MB in the beginning and 64.5 MB in the end (delta: 28.5 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-11-03 05:10:38,499 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.82 ms. Allocated memory is still 94.4 MB. Free memory was 58.9 MB in the beginning and 62.5 MB in the end (delta: -3.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-11-03 05:10:38,500 INFO L168 Benchmark]: Boogie Procedure Inliner took 87.71 ms. Allocated memory is still 94.4 MB. Free memory was 62.5 MB in the beginning and 59.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:10:38,500 INFO L168 Benchmark]: Boogie Preprocessor took 56.78 ms. Allocated memory is still 94.4 MB. Free memory was 59.4 MB in the beginning and 56.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:10:38,501 INFO L168 Benchmark]: RCFGBuilder took 1340.97 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 56.6 MB in the beginning and 59.7 MB in the end (delta: -3.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:10:38,502 INFO L168 Benchmark]: TraceAbstraction took 8489.59 ms. Allocated memory was 113.2 MB in the beginning and 169.9 MB in the end (delta: 56.6 MB). Free memory was 59.7 MB in the beginning and 79.4 MB in the end (delta: -19.7 MB). Peak memory consumption was 36.9 MB. Max. memory is 16.1 GB. [2021-11-03 05:10:38,502 INFO L168 Benchmark]: Witness Printer took 64.88 ms. Allocated memory is still 169.9 MB. Free memory was 79.4 MB in the beginning and 77.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-11-03 05:10:38,504 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.29 ms. Allocated memory is still 94.4 MB. Free memory was 64.5 MB in the beginning and 64.5 MB in the end (delta: 28.5 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 629.82 ms. Allocated memory is still 94.4 MB. Free memory was 58.9 MB in the beginning and 62.5 MB in the end (delta: -3.6 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 87.71 ms. Allocated memory is still 94.4 MB. Free memory was 62.5 MB in the beginning and 59.7 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 56.78 ms. Allocated memory is still 94.4 MB. Free memory was 59.4 MB in the beginning and 56.9 MB in the end (delta: 2.4 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1340.97 ms. Allocated memory was 94.4 MB in the beginning and 113.2 MB in the end (delta: 18.9 MB). Free memory was 56.6 MB in the beginning and 59.7 MB in the end (delta: -3.1 MB). Peak memory consumption was 23.1 MB. Max. memory is 16.1 GB. * TraceAbstraction took 8489.59 ms. Allocated memory was 113.2 MB in the beginning and 169.9 MB in the end (delta: 56.6 MB). Free memory was 59.7 MB in the beginning and 79.4 MB in the end (delta: -19.7 MB). Peak memory consumption was 36.9 MB. Max. memory is 16.1 GB. * Witness Printer took 64.88 ms. Allocated memory is still 169.9 MB. Free memory was 79.4 MB in the beginning and 77.3 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: 565]: not all allocated memory was freed not all allocated memory was freed We found a FailurePath: [L638] struct list *data = ((void *)0); [L639] COND TRUE __VERIFIER_nondet_int() [L640] struct node *node = malloc(sizeof *node); [L641] COND FALSE !(!node) [L643] node->next = node [L644] node->value = __VERIFIER_nondet_int() [L645] struct list *item = malloc(sizeof *item); [L646] COND FALSE !(!item) [L648] item->slist = node [L649] item->next = data [L650] data = item [L639] COND FALSE !(__VERIFIER_nondet_int()) [L652] COND FALSE !(!data) [L615] COND FALSE !(!(shape)) [L616] shape->next [L616] COND FALSE !(shape->next) [L622] COND FALSE !(!(shape)) [L623] EXPR shape->next [L623] COND FALSE !(!(shape->next == ((void *)0))) [L624] EXPR shape->slist [L624] COND FALSE !(!(shape->slist)) [L625] EXPR shape->slist [L625] EXPR shape->slist->next [L625] COND TRUE !(shape->slist->next == ((void *)0)) [L565] reach_error() - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 643]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 644]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 648]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 649]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 618]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 619]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 620]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 616]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 623]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 624]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 625]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 655]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 599]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 601]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 605]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 584]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 588]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 589]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 578]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 579]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 581]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 582]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 606]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 608]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 609]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 630]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 631]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 633]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 634]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 565]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 658]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 659]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 661]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 662]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 636]: 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, 255 locations, 131 error locations. Started 1 CEGAR loops. OverallTime: 8.3s, OverallIterations: 19, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 6.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 3876 SDtfs, 12370 SDslu, 6932 SDs, 0 SdLazy, 5417 SolverSat, 220 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 4.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 134 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 99 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=282occurred in iteration=10, InterpolantAutomatonStates: 101, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.2s AutomataMinimizationTime, 18 MinimizatonAttempts, 4186 StatesRemovedByMinimization, 17 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 284 NumberOfCodeBlocks, 284 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 240 ConstructedInterpolants, 0 QuantifiedInterpolants, 1759 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 24/24 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-11-03 05:10:38,578 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_17dd3fd4-9fcc-45c2-a16e-a57224db6d2c/bin/utaipan-aC7eJsxGYH/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-memcleanup)