./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/forester-heap/sll-01-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 7b2dab56 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/config/TaipanReach.xml -i ../../sv-benchmarks/c/forester-heap/sll-01-2.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2ea18b6ba0d977117db11fbdff34c486def646c3 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-7b2dab5 [2021-10-11 02:24:24,297 INFO L177 SettingsManager]: Resetting all preferences to default values... [2021-10-11 02:24:24,299 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2021-10-11 02:24:24,341 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2021-10-11 02:24:24,342 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2021-10-11 02:24:24,348 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2021-10-11 02:24:24,351 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2021-10-11 02:24:24,356 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2021-10-11 02:24:24,358 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2021-10-11 02:24:24,366 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2021-10-11 02:24:24,367 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2021-10-11 02:24:24,368 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2021-10-11 02:24:24,368 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2021-10-11 02:24:24,371 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2021-10-11 02:24:24,372 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2021-10-11 02:24:24,374 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2021-10-11 02:24:24,376 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2021-10-11 02:24:24,377 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2021-10-11 02:24:24,382 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2021-10-11 02:24:24,392 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2021-10-11 02:24:24,394 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2021-10-11 02:24:24,395 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2021-10-11 02:24:24,399 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2021-10-11 02:24:24,400 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2021-10-11 02:24:24,403 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2021-10-11 02:24:24,403 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2021-10-11 02:24:24,404 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2021-10-11 02:24:24,405 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2021-10-11 02:24:24,406 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2021-10-11 02:24:24,407 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2021-10-11 02:24:24,408 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2021-10-11 02:24:24,409 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2021-10-11 02:24:24,411 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2021-10-11 02:24:24,412 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2021-10-11 02:24:24,413 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2021-10-11 02:24:24,413 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2021-10-11 02:24:24,414 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2021-10-11 02:24:24,414 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2021-10-11 02:24:24,414 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2021-10-11 02:24:24,415 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2021-10-11 02:24:24,416 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2021-10-11 02:24:24,418 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/config/svcomp-Reach-32bit-Taipan_Default.epf [2021-10-11 02:24:24,464 INFO L113 SettingsManager]: Loading preferences was successful [2021-10-11 02:24:24,464 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2021-10-11 02:24:24,465 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2021-10-11 02:24:24,465 INFO L138 SettingsManager]: * User list type=DISABLED [2021-10-11 02:24:24,466 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2021-10-11 02:24:24,466 INFO L138 SettingsManager]: * Explicit value domain=true [2021-10-11 02:24:24,466 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2021-10-11 02:24:24,466 INFO L138 SettingsManager]: * Octagon Domain=false [2021-10-11 02:24:24,466 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2021-10-11 02:24:24,466 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2021-10-11 02:24:24,467 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2021-10-11 02:24:24,468 INFO L138 SettingsManager]: * Interval Domain=false [2021-10-11 02:24:24,468 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2021-10-11 02:24:24,468 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2021-10-11 02:24:24,468 INFO L138 SettingsManager]: * Simplification Technique=SIMPLIFY_QUICK [2021-10-11 02:24:24,469 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2021-10-11 02:24:24,469 INFO L138 SettingsManager]: * sizeof long=4 [2021-10-11 02:24:24,469 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2021-10-11 02:24:24,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2021-10-11 02:24:24,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2021-10-11 02:24:24,470 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2021-10-11 02:24:24,470 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2021-10-11 02:24:24,470 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2021-10-11 02:24:24,471 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2021-10-11 02:24:24,471 INFO L138 SettingsManager]: * sizeof long double=12 [2021-10-11 02:24:24,471 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2021-10-11 02:24:24,471 INFO L138 SettingsManager]: * Use constant arrays=true [2021-10-11 02:24:24,471 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2021-10-11 02:24:24,472 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2021-10-11 02:24:24,473 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2021-10-11 02:24:24,473 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:24:24,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2021-10-11 02:24:24,474 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2021-10-11 02:24:24,474 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2021-10-11 02:24:24,474 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2021-10-11 02:24:24,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2021-10-11 02:24:24,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2021-10-11 02:24:24,475 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2021-10-11 02:24:24,475 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2021-10-11 02:24:24,475 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/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_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI 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 ! call(reach_error())) ) 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 -> 2ea18b6ba0d977117db11fbdff34c486def646c3 [2021-10-11 02:24:24,802 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2021-10-11 02:24:24,827 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2021-10-11 02:24:24,831 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2021-10-11 02:24:24,832 INFO L271 PluginConnector]: Initializing CDTParser... [2021-10-11 02:24:24,833 INFO L275 PluginConnector]: CDTParser initialized [2021-10-11 02:24:24,834 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/../../sv-benchmarks/c/forester-heap/sll-01-2.i [2021-10-11 02:24:24,920 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/data/2fe98d690/168da85b1e9e49fa8ff1ae3fc6df8e64/FLAG263d02384 [2021-10-11 02:24:25,488 INFO L306 CDTParser]: Found 1 translation units. [2021-10-11 02:24:25,491 INFO L160 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i [2021-10-11 02:24:25,512 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/data/2fe98d690/168da85b1e9e49fa8ff1ae3fc6df8e64/FLAG263d02384 [2021-10-11 02:24:25,756 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/data/2fe98d690/168da85b1e9e49fa8ff1ae3fc6df8e64 [2021-10-11 02:24:25,758 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2021-10-11 02:24:25,760 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2021-10-11 02:24:25,761 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2021-10-11 02:24:25,761 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2021-10-11 02:24:25,764 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2021-10-11 02:24:25,765 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:24:25" (1/1) ... [2021-10-11 02:24:25,767 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57adec98 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:25, skipping insertion in model container [2021-10-11 02:24:25,767 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 02:24:25" (1/1) ... [2021-10-11 02:24:25,774 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2021-10-11 02:24:25,811 INFO L178 MainTranslator]: Built tables and reachable declarations [2021-10-11 02:24:26,117 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-10-11 02:24:26,124 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-10-11 02:24:26,126 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-10-11 02:24:26,127 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-10-11 02:24:26,130 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-10-11 02:24:26,131 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-10-11 02:24:26,133 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-10-11 02:24:26,134 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-10-11 02:24:26,135 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-10-11 02:24:26,137 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-10-11 02:24:26,138 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-10-11 02:24:26,139 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-10-11 02:24:26,140 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-10-11 02:24:26,147 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:24:26,157 INFO L203 MainTranslator]: Completed pre-run [2021-10-11 02:24:26,210 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22034,22047] [2021-10-11 02:24:26,212 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22307,22320] [2021-10-11 02:24:26,214 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22516,22529] [2021-10-11 02:24:26,215 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22586,22599] [2021-10-11 02:24:26,217 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22853,22866] [2021-10-11 02:24:26,218 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[22961,22974] [2021-10-11 02:24:26,220 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23192,23205] [2021-10-11 02:24:26,221 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23272,23285] [2021-10-11 02:24:26,222 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23351,23364] [2021-10-11 02:24:26,223 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23484,23497] [2021-10-11 02:24:26,225 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23662,23675] [2021-10-11 02:24:26,226 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23740,23753] [2021-10-11 02:24:26,226 WARN L226 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_f12eea4c-f5f2-4f5a-a93f-628949b02303/sv-benchmarks/c/forester-heap/sll-01-2.i[23817,23830] [2021-10-11 02:24:26,228 INFO L206 PostProcessor]: Analyzing one entry point: main [2021-10-11 02:24:26,279 INFO L208 MainTranslator]: Completed translation [2021-10-11 02:24:26,279 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26 WrapperNode [2021-10-11 02:24:26,280 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2021-10-11 02:24:26,281 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2021-10-11 02:24:26,281 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2021-10-11 02:24:26,281 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2021-10-11 02:24:26,288 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (1/1) ... [2021-10-11 02:24:26,303 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (1/1) ... [2021-10-11 02:24:26,335 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2021-10-11 02:24:26,337 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2021-10-11 02:24:26,338 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2021-10-11 02:24:26,338 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2021-10-11 02:24:26,347 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (1/1) ... [2021-10-11 02:24:26,347 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (1/1) ... [2021-10-11 02:24:26,367 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (1/1) ... [2021-10-11 02:24:26,367 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (1/1) ... [2021-10-11 02:24:26,380 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (1/1) ... [2021-10-11 02:24:26,396 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (1/1) ... [2021-10-11 02:24:26,414 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (1/1) ... [2021-10-11 02:24:26,418 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2021-10-11 02:24:26,419 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2021-10-11 02:24:26,419 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2021-10-11 02:24:26,420 INFO L275 PluginConnector]: RCFGBuilder initialized [2021-10-11 02:24:26,420 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (1/1) ... No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2021-10-11 02:24:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2021-10-11 02:24:26,504 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2021-10-11 02:24:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2021-10-11 02:24:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2021-10-11 02:24:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2021-10-11 02:24:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2021-10-11 02:24:26,505 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2021-10-11 02:24:26,506 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2021-10-11 02:24:27,319 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2021-10-11 02:24:27,319 INFO L299 CfgBuilder]: Removed 34 assume(true) statements. [2021-10-11 02:24:27,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:27 BoogieIcfgContainer [2021-10-11 02:24:27,321 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2021-10-11 02:24:27,323 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2021-10-11 02:24:27,323 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2021-10-11 02:24:27,326 INFO L275 PluginConnector]: TraceAbstraction initialized [2021-10-11 02:24:27,326 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 02:24:25" (1/3) ... [2021-10-11 02:24:27,327 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29caf28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:24:27, skipping insertion in model container [2021-10-11 02:24:27,327 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 02:24:26" (2/3) ... [2021-10-11 02:24:27,328 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29caf28f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 02:24:27, skipping insertion in model container [2021-10-11 02:24:27,328 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:27" (3/3) ... [2021-10-11 02:24:27,329 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-01-2.i [2021-10-11 02:24:27,342 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2021-10-11 02:24:27,345 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2021-10-11 02:24:27,355 INFO L253 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2021-10-11 02:24:27,378 INFO L377 AbstractCegarLoop]: Interprodecural is true [2021-10-11 02:24:27,378 INFO L378 AbstractCegarLoop]: Hoare is true [2021-10-11 02:24:27,378 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2021-10-11 02:24:27,379 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2021-10-11 02:24:27,379 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2021-10-11 02:24:27,379 INFO L382 AbstractCegarLoop]: Difference is false [2021-10-11 02:24:27,379 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2021-10-11 02:24:27,379 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2021-10-11 02:24:27,394 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states. [2021-10-11 02:24:27,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2021-10-11 02:24:27,399 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:27,399 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1] [2021-10-11 02:24:27,400 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:27,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:27,405 INFO L82 PathProgramCache]: Analyzing trace with hash 352944, now seen corresponding path program 1 times [2021-10-11 02:24:27,414 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:27,415 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1998420385] [2021-10-11 02:24:27,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:27,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:27,606 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:27,607 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1998420385] [2021-10-11 02:24:27,608 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:27,608 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2021-10-11 02:24:27,608 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040261265] [2021-10-11 02:24:27,612 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:24:27,612 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:27,627 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:24:27,628 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:27,630 INFO L87 Difference]: Start difference. First operand 74 states. Second operand 3 states. [2021-10-11 02:24:27,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:27,714 INFO L93 Difference]: Finished difference Result 163 states and 262 transitions. [2021-10-11 02:24:27,715 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:24:27,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2021-10-11 02:24:27,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:27,739 INFO L225 Difference]: With dead ends: 163 [2021-10-11 02:24:27,739 INFO L226 Difference]: Without dead ends: 89 [2021-10-11 02:24:27,742 INFO L677 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-10-11 02:24:27,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2021-10-11 02:24:27,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 71. [2021-10-11 02:24:27,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-10-11 02:24:27,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 75 transitions. [2021-10-11 02:24:27,789 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 75 transitions. Word has length 3 [2021-10-11 02:24:27,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:27,789 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 75 transitions. [2021-10-11 02:24:27,790 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:24:27,790 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 75 transitions. [2021-10-11 02:24:27,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2021-10-11 02:24:27,790 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:27,790 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:27,791 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2021-10-11 02:24:27,791 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:27,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:27,794 INFO L82 PathProgramCache]: Analyzing trace with hash -334641203, now seen corresponding path program 1 times [2021-10-11 02:24:27,796 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:27,796 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082024297] [2021-10-11 02:24:27,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:27,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:27,904 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082024297] [2021-10-11 02:24:27,904 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:27,904 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:24:27,904 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1643384865] [2021-10-11 02:24:27,906 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:24:27,907 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:27,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:24:27,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:27,913 INFO L87 Difference]: Start difference. First operand 71 states and 75 transitions. Second operand 3 states. [2021-10-11 02:24:27,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:27,934 INFO L93 Difference]: Finished difference Result 71 states and 75 transitions. [2021-10-11 02:24:27,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:24:27,934 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2021-10-11 02:24:27,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:27,938 INFO L225 Difference]: With dead ends: 71 [2021-10-11 02:24:27,938 INFO L226 Difference]: Without dead ends: 69 [2021-10-11 02:24:27,939 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:27,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2021-10-11 02:24:27,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2021-10-11 02:24:27,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2021-10-11 02:24:27,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2021-10-11 02:24:27,958 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 7 [2021-10-11 02:24:27,959 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:27,959 INFO L481 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2021-10-11 02:24:27,959 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:24:27,959 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2021-10-11 02:24:27,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2021-10-11 02:24:27,959 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:27,959 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:27,960 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2021-10-11 02:24:27,960 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:27,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:27,960 INFO L82 PathProgramCache]: Analyzing trace with hash 1758104138, now seen corresponding path program 1 times [2021-10-11 02:24:27,960 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:27,960 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1407219636] [2021-10-11 02:24:27,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:27,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:28,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:28,013 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1407219636] [2021-10-11 02:24:28,013 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:28,013 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:24:28,013 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106579641] [2021-10-11 02:24:28,014 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:24:28,014 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:28,014 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:24:28,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:28,015 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand 3 states. [2021-10-11 02:24:28,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:28,087 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2021-10-11 02:24:28,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:24:28,088 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2021-10-11 02:24:28,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:28,088 INFO L225 Difference]: With dead ends: 72 [2021-10-11 02:24:28,089 INFO L226 Difference]: Without dead ends: 68 [2021-10-11 02:24:28,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:28,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2021-10-11 02:24:28,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 65. [2021-10-11 02:24:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2021-10-11 02:24:28,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2021-10-11 02:24:28,094 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 12 [2021-10-11 02:24:28,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:28,095 INFO L481 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2021-10-11 02:24:28,095 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:24:28,095 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2021-10-11 02:24:28,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2021-10-11 02:24:28,095 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:28,095 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:28,096 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2021-10-11 02:24:28,096 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:28,096 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:28,096 INFO L82 PathProgramCache]: Analyzing trace with hash -1333342370, now seen corresponding path program 1 times [2021-10-11 02:24:28,097 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:28,097 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [71077739] [2021-10-11 02:24:28,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:28,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:28,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:28,148 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [71077739] [2021-10-11 02:24:28,148 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:28,148 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:24:28,149 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680442388] [2021-10-11 02:24:28,149 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2021-10-11 02:24:28,149 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:28,150 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2021-10-11 02:24:28,150 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2021-10-11 02:24:28,150 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand 4 states. [2021-10-11 02:24:28,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:28,232 INFO L93 Difference]: Finished difference Result 123 states and 131 transitions. [2021-10-11 02:24:28,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2021-10-11 02:24:28,233 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2021-10-11 02:24:28,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:28,234 INFO L225 Difference]: With dead ends: 123 [2021-10-11 02:24:28,234 INFO L226 Difference]: Without dead ends: 103 [2021-10-11 02:24:28,235 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2021-10-11 02:24:28,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2021-10-11 02:24:28,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2021-10-11 02:24:28,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-10-11 02:24:28,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 68 transitions. [2021-10-11 02:24:28,241 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 68 transitions. Word has length 13 [2021-10-11 02:24:28,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:28,241 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 68 transitions. [2021-10-11 02:24:28,241 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2021-10-11 02:24:28,242 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 68 transitions. [2021-10-11 02:24:28,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:24:28,242 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:28,242 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:28,243 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2021-10-11 02:24:28,243 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:28,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:28,243 INFO L82 PathProgramCache]: Analyzing trace with hash 1865870330, now seen corresponding path program 1 times [2021-10-11 02:24:28,244 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:28,244 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2051216139] [2021-10-11 02:24:28,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:28,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:28,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:28,288 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2051216139] [2021-10-11 02:24:28,288 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:28,288 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:24:28,288 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940048314] [2021-10-11 02:24:28,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:24:28,289 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:28,289 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:24:28,289 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:28,290 INFO L87 Difference]: Start difference. First operand 64 states and 68 transitions. Second operand 3 states. [2021-10-11 02:24:28,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:28,303 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2021-10-11 02:24:28,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:24:28,303 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2021-10-11 02:24:28,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:28,304 INFO L225 Difference]: With dead ends: 89 [2021-10-11 02:24:28,304 INFO L226 Difference]: Without dead ends: 87 [2021-10-11 02:24:28,305 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:28,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2021-10-11 02:24:28,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 66. [2021-10-11 02:24:28,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2021-10-11 02:24:28,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 71 transitions. [2021-10-11 02:24:28,310 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 71 transitions. Word has length 17 [2021-10-11 02:24:28,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:28,311 INFO L481 AbstractCegarLoop]: Abstraction has 66 states and 71 transitions. [2021-10-11 02:24:28,311 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:24:28,311 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 71 transitions. [2021-10-11 02:24:28,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2021-10-11 02:24:28,312 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:28,312 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:28,312 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2021-10-11 02:24:28,312 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:28,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:28,313 INFO L82 PathProgramCache]: Analyzing trace with hash 1865870236, now seen corresponding path program 1 times [2021-10-11 02:24:28,313 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:28,313 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166639386] [2021-10-11 02:24:28,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:28,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:28,373 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:28,373 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166639386] [2021-10-11 02:24:28,373 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:28,373 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:24:28,373 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447738441] [2021-10-11 02:24:28,374 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:24:28,374 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:28,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:24:28,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:28,375 INFO L87 Difference]: Start difference. First operand 66 states and 71 transitions. Second operand 3 states. [2021-10-11 02:24:28,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:28,389 INFO L93 Difference]: Finished difference Result 66 states and 71 transitions. [2021-10-11 02:24:28,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:24:28,390 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 17 [2021-10-11 02:24:28,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:28,390 INFO L225 Difference]: With dead ends: 66 [2021-10-11 02:24:28,390 INFO L226 Difference]: Without dead ends: 64 [2021-10-11 02:24:28,391 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:28,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2021-10-11 02:24:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2021-10-11 02:24:28,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2021-10-11 02:24:28,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 69 transitions. [2021-10-11 02:24:28,402 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 69 transitions. Word has length 17 [2021-10-11 02:24:28,403 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:28,403 INFO L481 AbstractCegarLoop]: Abstraction has 64 states and 69 transitions. [2021-10-11 02:24:28,403 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:24:28,403 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 69 transitions. [2021-10-11 02:24:28,404 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2021-10-11 02:24:28,404 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:28,405 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:28,405 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2021-10-11 02:24:28,405 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:28,405 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:28,406 INFO L82 PathProgramCache]: Analyzing trace with hash 1060479069, now seen corresponding path program 1 times [2021-10-11 02:24:28,406 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:28,407 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1189463644] [2021-10-11 02:24:28,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:28,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:28,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:28,503 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1189463644] [2021-10-11 02:24:28,503 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:28,503 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:24:28,503 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1767383533] [2021-10-11 02:24:28,504 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:24:28,504 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:28,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:24:28,509 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:28,510 INFO L87 Difference]: Start difference. First operand 64 states and 69 transitions. Second operand 3 states. [2021-10-11 02:24:28,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:28,520 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2021-10-11 02:24:28,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:24:28,521 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2021-10-11 02:24:28,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:28,523 INFO L225 Difference]: With dead ends: 64 [2021-10-11 02:24:28,523 INFO L226 Difference]: Without dead ends: 62 [2021-10-11 02:24:28,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:28,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2021-10-11 02:24:28,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 62. [2021-10-11 02:24:28,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2021-10-11 02:24:28,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 67 transitions. [2021-10-11 02:24:28,537 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 67 transitions. Word has length 18 [2021-10-11 02:24:28,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:28,538 INFO L481 AbstractCegarLoop]: Abstraction has 62 states and 67 transitions. [2021-10-11 02:24:28,538 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:24:28,538 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 67 transitions. [2021-10-11 02:24:28,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2021-10-11 02:24:28,539 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:28,539 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:28,539 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2021-10-11 02:24:28,540 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:28,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:28,540 INFO L82 PathProgramCache]: Analyzing trace with hash 677550211, now seen corresponding path program 1 times [2021-10-11 02:24:28,540 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:28,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137878708] [2021-10-11 02:24:28,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:28,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:28,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:28,852 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137878708] [2021-10-11 02:24:28,852 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:28,852 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 02:24:28,852 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1943701887] [2021-10-11 02:24:28,853 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 02:24:28,853 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:28,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 02:24:28,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:24:28,854 INFO L87 Difference]: Start difference. First operand 62 states and 67 transitions. Second operand 8 states. [2021-10-11 02:24:29,280 WARN L197 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-10-11 02:24:29,651 WARN L197 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 60 [2021-10-11 02:24:29,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:29,892 INFO L93 Difference]: Finished difference Result 161 states and 174 transitions. [2021-10-11 02:24:29,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 02:24:29,893 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2021-10-11 02:24:29,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:29,896 INFO L225 Difference]: With dead ends: 161 [2021-10-11 02:24:29,896 INFO L226 Difference]: Without dead ends: 159 [2021-10-11 02:24:29,898 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:24:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2021-10-11 02:24:29,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 73. [2021-10-11 02:24:29,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73 states. [2021-10-11 02:24:29,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 80 transitions. [2021-10-11 02:24:29,917 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 80 transitions. Word has length 20 [2021-10-11 02:24:29,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:29,917 INFO L481 AbstractCegarLoop]: Abstraction has 73 states and 80 transitions. [2021-10-11 02:24:29,917 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 02:24:29,918 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 80 transitions. [2021-10-11 02:24:29,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:24:29,920 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:29,921 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:29,921 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2021-10-11 02:24:29,921 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:29,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:29,927 INFO L82 PathProgramCache]: Analyzing trace with hash -2030139134, now seen corresponding path program 1 times [2021-10-11 02:24:29,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:29,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677762629] [2021-10-11 02:24:29,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:29,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2021-10-11 02:24:29,977 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677762629] [2021-10-11 02:24:29,978 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:29,978 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2021-10-11 02:24:29,978 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1955803233] [2021-10-11 02:24:29,979 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2021-10-11 02:24:29,979 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:29,979 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2021-10-11 02:24:29,981 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:29,981 INFO L87 Difference]: Start difference. First operand 73 states and 80 transitions. Second operand 3 states. [2021-10-11 02:24:30,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:30,046 INFO L93 Difference]: Finished difference Result 73 states and 80 transitions. [2021-10-11 02:24:30,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2021-10-11 02:24:30,046 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 23 [2021-10-11 02:24:30,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:30,047 INFO L225 Difference]: With dead ends: 73 [2021-10-11 02:24:30,047 INFO L226 Difference]: Without dead ends: 71 [2021-10-11 02:24:30,048 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2021-10-11 02:24:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2021-10-11 02:24:30,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2021-10-11 02:24:30,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2021-10-11 02:24:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 78 transitions. [2021-10-11 02:24:30,053 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 78 transitions. Word has length 23 [2021-10-11 02:24:30,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:30,053 INFO L481 AbstractCegarLoop]: Abstraction has 71 states and 78 transitions. [2021-10-11 02:24:30,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2021-10-11 02:24:30,054 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 78 transitions. [2021-10-11 02:24:30,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2021-10-11 02:24:30,058 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:30,059 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:30,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2021-10-11 02:24:30,059 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:30,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:30,060 INFO L82 PathProgramCache]: Analyzing trace with hash -1443843058, now seen corresponding path program 1 times [2021-10-11 02:24:30,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:30,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [752436282] [2021-10-11 02:24:30,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:30,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:30,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:30,287 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [752436282] [2021-10-11 02:24:30,287 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:30,287 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 02:24:30,287 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140524803] [2021-10-11 02:24:30,288 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 02:24:30,288 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:30,288 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 02:24:30,288 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:24:30,288 INFO L87 Difference]: Start difference. First operand 71 states and 78 transitions. Second operand 8 states. [2021-10-11 02:24:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:31,087 INFO L93 Difference]: Finished difference Result 153 states and 166 transitions. [2021-10-11 02:24:31,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 02:24:31,087 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 23 [2021-10-11 02:24:31,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:31,088 INFO L225 Difference]: With dead ends: 153 [2021-10-11 02:24:31,089 INFO L226 Difference]: Without dead ends: 151 [2021-10-11 02:24:31,089 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=87, Invalid=185, Unknown=0, NotChecked=0, Total=272 [2021-10-11 02:24:31,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2021-10-11 02:24:31,095 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 74. [2021-10-11 02:24:31,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2021-10-11 02:24:31,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2021-10-11 02:24:31,096 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 23 [2021-10-11 02:24:31,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:31,096 INFO L481 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2021-10-11 02:24:31,096 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 02:24:31,096 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2021-10-11 02:24:31,097 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2021-10-11 02:24:31,097 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:31,097 INFO L422 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] [2021-10-11 02:24:31,097 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2021-10-11 02:24:31,097 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:31,098 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:31,098 INFO L82 PathProgramCache]: Analyzing trace with hash 1641512003, now seen corresponding path program 1 times [2021-10-11 02:24:31,098 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:31,098 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1148335711] [2021-10-11 02:24:31,098 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:31,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:31,185 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:31,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1148335711] [2021-10-11 02:24:31,185 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1742180810] [2021-10-11 02:24:31,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:24:31,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:31,281 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 23 conjunts are in the unsatisfiable core [2021-10-11 02:24:31,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:24:31,483 INFO L348 Elim1Store]: treesize reduction 73, result has 33.0 percent of original size [2021-10-11 02:24:31,484 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 3 case distinctions, treesize of input 15 treesize of output 41 [2021-10-11 02:24:31,486 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:31,537 INFO L625 ElimStorePlain]: treesize reduction 10, result has 84.8 percent of original size [2021-10-11 02:24:31,553 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-11 02:24:31,556 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:31,602 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:31,607 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2021-10-11 02:24:31,607 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:31,631 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:31,642 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,648 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,651 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-10-11 02:24:31,654 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2021-10-11 02:24:31,654 INFO L244 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:41, output treesize:48 [2021-10-11 02:24:31,658 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,662 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,665 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-10-11 02:24:31,710 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,712 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,717 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-10-11 02:24:31,765 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,771 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,772 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 3 disjuncts [2021-10-11 02:24:31,885 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,888 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,893 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:31,918 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:31,944 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,947 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:31,949 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2021-10-11 02:24:31,952 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:31,982 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:32,009 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:24:32,042 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:32,077 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:32,078 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:32,079 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:32,110 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:32,122 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:32,124 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 2 disjuncts [2021-10-11 02:24:32,124 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 5 disjuncts [2021-10-11 02:24:32,126 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:32,140 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:32,154 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:24:32,168 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:32,185 INFO L639 QuantifierPusher]: Distributing 4 conjuncts over 7 disjuncts [2021-10-11 02:24:32,187 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:32,197 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:32,208 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:32,220 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:24:32,236 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:32,246 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:32,256 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:32,267 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:24:32,282 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:32,292 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:32,301 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 4 disjuncts [2021-10-11 02:24:32,311 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:24:32,325 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:32,351 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 2 disjuncts [2021-10-11 02:24:32,363 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 5 disjuncts [2021-10-11 02:24:32,377 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 7 disjuncts [2021-10-11 02:24:32,529 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:32,529 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 34 [2021-10-11 02:24:32,539 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:32,548 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:24:32,549 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:32,730 INFO L244 Elim1Store]: Index analysis took 159 ms [2021-10-11 02:24:32,770 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:32,771 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2021-10-11 02:24:32,777 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:32,795 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:24:32,796 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:32,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:32,846 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-11 02:24:32,901 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-11 02:24:32,927 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:32,927 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 29 [2021-10-11 02:24:32,929 INFO L547 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:33,111 INFO L244 Elim1Store]: Index analysis took 158 ms [2021-10-11 02:24:33,139 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:33,139 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 21 treesize of output 53 [2021-10-11 02:24:33,142 INFO L547 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:33,401 INFO L244 Elim1Store]: Index analysis took 237 ms [2021-10-11 02:24:33,450 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:33,450 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 26 treesize of output 88 [2021-10-11 02:24:33,454 INFO L547 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:33,463 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:24:33,464 INFO L547 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:34,948 WARN L197 SmtUtils]: Spent 1.48 s on a formula simplification. DAG size of input: 95 DAG size of output: 88 [2021-10-11 02:24:34,949 INFO L625 ElimStorePlain]: treesize reduction 611, result has 67.2 percent of original size [2021-10-11 02:24:34,962 INFO L443 ElimStorePlain]: Different costs {0=[|#memory_int|, |v_#memory_int_54|, v_prenex_1, v_prenex_2], 2=[|v_#memory_int_52|, |v_#memory_int_53|], 16=[|v_#memory_$Pointer$.offset_51|, |v_#memory_$Pointer$.base_51|]} [2021-10-11 02:24:34,975 INFO L547 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:34,986 INFO L547 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:35,386 WARN L197 SmtUtils]: Spent 398.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2021-10-11 02:24:35,386 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:35,414 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-10-11 02:24:35,415 INFO L547 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:35,428 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2021-10-11 02:24:35,428 INFO L547 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:35,762 WARN L197 SmtUtils]: Spent 333.00 ms on a formula simplification that was a NOOP. DAG size: 74 [2021-10-11 02:24:35,764 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:35,773 INFO L547 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:36,339 WARN L197 SmtUtils]: Spent 566.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 64 [2021-10-11 02:24:36,340 INFO L625 ElimStorePlain]: treesize reduction 8, result has 99.0 percent of original size [2021-10-11 02:24:36,340 INFO L515 ElimStorePlain]: Eliminatee v_prenex_2 vanished before elimination [2021-10-11 02:24:36,350 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-10-11 02:24:36,350 INFO L547 ElimStorePlain]: Start of recursive call 15: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:36,360 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2021-10-11 02:24:36,360 INFO L547 ElimStorePlain]: Start of recursive call 16: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:36,534 WARN L197 SmtUtils]: Spent 173.00 ms on a formula simplification that was a NOOP. DAG size: 56 [2021-10-11 02:24:36,534 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:36,534 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_int_53| vanished before elimination [2021-10-11 02:24:36,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:36,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:36,564 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-11 02:24:36,582 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-11 02:24:36,622 INFO L348 Elim1Store]: treesize reduction 86, result has 27.7 percent of original size [2021-10-11 02:24:36,622 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 219 [2021-10-11 02:24:36,625 INFO L547 ElimStorePlain]: Start of recursive call 17: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:36,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:36,640 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:36,645 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-11 02:24:36,651 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-11 02:24:36,692 INFO L348 Elim1Store]: treesize reduction 86, result has 27.7 percent of original size [2021-10-11 02:24:36,692 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 278 treesize of output 219 [2021-10-11 02:24:36,705 INFO L547 ElimStorePlain]: Start of recursive call 18: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:36,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:36,721 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-11 02:24:36,723 INFO L547 ElimStorePlain]: Start of recursive call 19: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:36,979 WARN L197 SmtUtils]: Spent 255.00 ms on a formula simplification. DAG size of input: 54 DAG size of output: 50 [2021-10-11 02:24:36,979 INFO L625 ElimStorePlain]: treesize reduction 32, result has 93.7 percent of original size [2021-10-11 02:24:36,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:36,995 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2021-10-11 02:24:36,996 INFO L547 ElimStorePlain]: Start of recursive call 20: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:37,002 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:37,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:37,017 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-11 02:24:37,043 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:37,044 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 75 [2021-10-11 02:24:37,047 INFO L547 ElimStorePlain]: Start of recursive call 21: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:37,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:37,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2021-10-11 02:24:37,063 INFO L173 IndexEqualityManager]: detected equality via solver [2021-10-11 02:24:37,091 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:37,091 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 49 treesize of output 75 [2021-10-11 02:24:37,093 INFO L547 ElimStorePlain]: Start of recursive call 22: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:37,267 WARN L197 SmtUtils]: Spent 172.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 43 [2021-10-11 02:24:37,267 INFO L625 ElimStorePlain]: treesize reduction 60, result has 75.9 percent of original size [2021-10-11 02:24:37,272 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-10-11 02:24:37,273 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:24:37,275 INFO L398 QuantifierPusher]: Applying distributivity to a CONJUNCTION[6, 2, 1] term [2021-10-11 02:24:37,276 INFO L639 QuantifierPusher]: Distributing 2 conjuncts over 6 disjuncts [2021-10-11 02:24:37,276 INFO L547 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-1 vars, 8 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-10-11 02:24:37,280 INFO L244 ElimStorePlain]: Needed 22 recursive calls to eliminate 12 variables, input treesize:2757, output treesize:157 [2021-10-11 02:24:37,574 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 10 [2021-10-11 02:24:37,576 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:37,585 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:37,590 INFO L348 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:37,590 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2021-10-11 02:24:37,592 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:37,596 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:37,597 INFO L547 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2021-10-11 02:24:37,597 INFO L244 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:43, output treesize:7 [2021-10-11 02:24:37,612 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:37,612 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:24:37,723 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:24:37,728 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 2 conjuncts [2021-10-11 02:24:37,740 INFO L639 QuantifierPusher]: Distributing 3 disjuncts over 2 conjuncts [2021-10-11 02:24:37,741 INFO L639 QuantifierPusher]: Distributing 2 disjuncts over 3 conjuncts [2021-10-11 02:24:37,770 INFO L443 ElimStorePlain]: Different costs {0=[v_prenex_4, |#memory_int|, v_prenex_7, |v_#memory_int_55|, v_prenex_3, v_prenex_11, v_prenex_10, v_prenex_8], 2=[|v_#memory_int_52|, v_prenex_5, |v_#memory_int_53|, v_prenex_6]} [2021-10-11 02:24:37,794 INFO L547 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:38,379 WARN L197 SmtUtils]: Spent 583.00 ms on a formula simplification that was a NOOP. DAG size: 140 [2021-10-11 02:24:38,379 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:38,439 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2021-10-11 02:24:38,440 INFO L547 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:38,710 WARN L197 SmtUtils]: Spent 270.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 81 [2021-10-11 02:24:38,711 INFO L625 ElimStorePlain]: treesize reduction 399, result has 61.4 percent of original size [2021-10-11 02:24:38,719 INFO L382 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 1 [2021-10-11 02:24:38,721 INFO L547 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:38,788 INFO L625 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2021-10-11 02:24:38,788 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_int_55| vanished before elimination [2021-10-11 02:24:38,788 INFO L515 ElimStorePlain]: Eliminatee v_prenex_3 vanished before elimination [2021-10-11 02:24:38,806 INFO L547 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2021-10-11 02:24:38,832 INFO L625 ElimStorePlain]: treesize reduction 569, result has 4.2 percent of original size [2021-10-11 02:24:38,832 INFO L515 ElimStorePlain]: Eliminatee v_prenex_10 vanished before elimination [2021-10-11 02:24:38,832 INFO L515 ElimStorePlain]: Eliminatee v_prenex_8 vanished before elimination [2021-10-11 02:24:38,832 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_int_52| vanished before elimination [2021-10-11 02:24:38,832 INFO L515 ElimStorePlain]: Eliminatee v_prenex_5 vanished before elimination [2021-10-11 02:24:38,832 INFO L515 ElimStorePlain]: Eliminatee |v_#memory_int_53| vanished before elimination [2021-10-11 02:24:38,832 INFO L515 ElimStorePlain]: Eliminatee v_prenex_6 vanished before elimination [2021-10-11 02:24:38,833 INFO L547 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 12 dim-2 vars, End of recursive call: and 2 xjuncts. [2021-10-11 02:24:38,833 INFO L244 ElimStorePlain]: Needed 5 recursive calls to eliminate 14 variables, input treesize:1245, output treesize:25 [2021-10-11 02:24:38,862 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:38,862 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1694596924] [2021-10-11 02:24:38,882 INFO L159 IcfgInterpreter]: Started Sifa with 24 locations of interest [2021-10-11 02:24:38,882 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:24:38,887 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:24:38,902 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:24:38,902 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:24:39,200 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:24:39,962 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:24:40,396 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:24:40,635 WARN L197 SmtUtils]: Spent 145.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-10-11 02:24:41,324 WARN L197 SmtUtils]: Spent 561.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2021-10-11 02:24:42,189 WARN L197 SmtUtils]: Spent 798.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 104 [2021-10-11 02:24:42,863 WARN L197 SmtUtils]: Spent 511.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2021-10-11 02:24:43,432 WARN L197 SmtUtils]: Spent 497.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2021-10-11 02:24:43,909 WARN L197 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 43 [2021-10-11 02:24:44,232 WARN L197 SmtUtils]: Spent 230.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 81 [2021-10-11 02:24:44,484 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:24:44,484 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:24:44,484 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 13 [2021-10-11 02:24:44,485 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586905517] [2021-10-11 02:24:44,485 INFO L461 AbstractCegarLoop]: Interpolant automaton has 14 states [2021-10-11 02:24:44,485 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:44,486 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2021-10-11 02:24:44,486 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=465, Unknown=0, NotChecked=0, Total=600 [2021-10-11 02:24:44,486 INFO L87 Difference]: Start difference. First operand 74 states and 81 transitions. Second operand 14 states. [2021-10-11 02:24:44,879 WARN L197 SmtUtils]: Spent 163.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 77 [2021-10-11 02:24:45,130 WARN L197 SmtUtils]: Spent 176.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 79 [2021-10-11 02:24:45,311 WARN L197 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 67 [2021-10-11 02:24:45,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:45,657 INFO L93 Difference]: Finished difference Result 155 states and 169 transitions. [2021-10-11 02:24:45,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:24:45,658 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 25 [2021-10-11 02:24:45,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:45,659 INFO L225 Difference]: With dead ends: 155 [2021-10-11 02:24:45,659 INFO L226 Difference]: Without dead ends: 117 [2021-10-11 02:24:45,660 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 43 SyntacticMatches, 12 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 336 ImplicationChecksByTransitivity, 5.2s TimeCoverageRelationStatistics Valid=210, Invalid=720, Unknown=0, NotChecked=0, Total=930 [2021-10-11 02:24:45,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2021-10-11 02:24:45,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 89. [2021-10-11 02:24:45,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2021-10-11 02:24:45,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 100 transitions. [2021-10-11 02:24:45,667 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 100 transitions. Word has length 25 [2021-10-11 02:24:45,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:45,667 INFO L481 AbstractCegarLoop]: Abstraction has 89 states and 100 transitions. [2021-10-11 02:24:45,667 INFO L482 AbstractCegarLoop]: Interpolant automaton has 14 states. [2021-10-11 02:24:45,667 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 100 transitions. [2021-10-11 02:24:45,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2021-10-11 02:24:45,668 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:45,668 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:45,878 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2021-10-11 02:24:45,879 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:45,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:45,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1858710973, now seen corresponding path program 1 times [2021-10-11 02:24:45,879 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:45,880 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052439470] [2021-10-11 02:24:45,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:45,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:46,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:46,081 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052439470] [2021-10-11 02:24:46,081 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2021-10-11 02:24:46,081 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2021-10-11 02:24:46,081 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402599041] [2021-10-11 02:24:46,081 INFO L461 AbstractCegarLoop]: Interpolant automaton has 8 states [2021-10-11 02:24:46,082 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:46,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2021-10-11 02:24:46,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2021-10-11 02:24:46,082 INFO L87 Difference]: Start difference. First operand 89 states and 100 transitions. Second operand 8 states. [2021-10-11 02:24:46,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:46,525 INFO L93 Difference]: Finished difference Result 185 states and 204 transitions. [2021-10-11 02:24:46,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2021-10-11 02:24:46,526 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 26 [2021-10-11 02:24:46,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:46,527 INFO L225 Difference]: With dead ends: 185 [2021-10-11 02:24:46,527 INFO L226 Difference]: Without dead ends: 169 [2021-10-11 02:24:46,528 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=70, Invalid=140, Unknown=0, NotChecked=0, Total=210 [2021-10-11 02:24:46,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2021-10-11 02:24:46,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 111. [2021-10-11 02:24:46,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111 states. [2021-10-11 02:24:46,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 129 transitions. [2021-10-11 02:24:46,536 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 129 transitions. Word has length 26 [2021-10-11 02:24:46,537 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:46,537 INFO L481 AbstractCegarLoop]: Abstraction has 111 states and 129 transitions. [2021-10-11 02:24:46,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 8 states. [2021-10-11 02:24:46,537 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 129 transitions. [2021-10-11 02:24:46,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2021-10-11 02:24:46,540 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:46,540 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:46,540 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53 [2021-10-11 02:24:46,540 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:46,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:46,541 INFO L82 PathProgramCache]: Analyzing trace with hash 588750087, now seen corresponding path program 1 times [2021-10-11 02:24:46,541 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:46,541 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685913639] [2021-10-11 02:24:46,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:46,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:46,602 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:46,602 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685913639] [2021-10-11 02:24:46,603 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1985497100] [2021-10-11 02:24:46,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:24:46,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:46,687 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 4 conjunts are in the unsatisfiable core [2021-10-11 02:24:46,689 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:24:46,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:46,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:24:46,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:46,747 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [256403855] [2021-10-11 02:24:46,749 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-10-11 02:24:46,749 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:24:46,749 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:24:46,749 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:24:46,750 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:24:47,282 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:24:47,766 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:24:48,233 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:24:48,401 WARN L197 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-10-11 02:24:49,021 WARN L197 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2021-10-11 02:24:49,893 WARN L197 SmtUtils]: Spent 832.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 104 [2021-10-11 02:24:50,514 WARN L197 SmtUtils]: Spent 509.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2021-10-11 02:24:51,106 WARN L197 SmtUtils]: Spent 535.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2021-10-11 02:24:51,743 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:24:51,743 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:24:51,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2021-10-11 02:24:51,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634288213] [2021-10-11 02:24:51,744 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2021-10-11 02:24:51,744 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:51,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2021-10-11 02:24:51,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-10-11 02:24:51,745 INFO L87 Difference]: Start difference. First operand 111 states and 129 transitions. Second operand 5 states. [2021-10-11 02:24:51,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:51,793 INFO L93 Difference]: Finished difference Result 194 states and 225 transitions. [2021-10-11 02:24:51,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2021-10-11 02:24:51,794 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 27 [2021-10-11 02:24:51,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:51,795 INFO L225 Difference]: With dead ends: 194 [2021-10-11 02:24:51,795 INFO L226 Difference]: Without dead ends: 192 [2021-10-11 02:24:51,796 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 58 SyntacticMatches, 9 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2021-10-11 02:24:51,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2021-10-11 02:24:51,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 135. [2021-10-11 02:24:51,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 135 states. [2021-10-11 02:24:51,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 160 transitions. [2021-10-11 02:24:51,806 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 160 transitions. Word has length 27 [2021-10-11 02:24:51,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:51,807 INFO L481 AbstractCegarLoop]: Abstraction has 135 states and 160 transitions. [2021-10-11 02:24:51,807 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2021-10-11 02:24:51,807 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 160 transitions. [2021-10-11 02:24:51,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2021-10-11 02:24:51,808 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:51,808 INFO L422 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, 1, 1, 1] [2021-10-11 02:24:52,022 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:24:52,022 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:52,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:52,023 INFO L82 PathProgramCache]: Analyzing trace with hash -1123954962, now seen corresponding path program 1 times [2021-10-11 02:24:52,023 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:52,023 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943715379] [2021-10-11 02:24:52,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:52,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:52,159 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:52,159 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943715379] [2021-10-11 02:24:52,160 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188125585] [2021-10-11 02:24:52,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2021-10-11 02:24:52,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2021-10-11 02:24:52,286 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 27 conjunts are in the unsatisfiable core [2021-10-11 02:24:52,295 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2021-10-11 02:24:52,408 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:52,408 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2021-10-11 02:24:52,532 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2021-10-11 02:24:52,532 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [729357404] [2021-10-11 02:24:52,535 INFO L159 IcfgInterpreter]: Started Sifa with 27 locations of interest [2021-10-11 02:24:52,535 INFO L166 IcfgInterpreter]: Building call graph [2021-10-11 02:24:52,536 INFO L171 IcfgInterpreter]: Initial procedures are [ULTIMATE.start] [2021-10-11 02:24:52,536 INFO L176 IcfgInterpreter]: Starting interpretation [2021-10-11 02:24:52,536 INFO L197 IcfgInterpreter]: Interpreting procedure ULTIMATE.start with input of size 1 for LOIs [2021-10-11 02:24:52,703 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:24:53,368 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:24:53,726 WARN L234 Elim1Store]: Array PQE input equivalent to false [2021-10-11 02:24:53,805 INFO L180 IcfgInterpreter]: Interpretation finished [2021-10-11 02:24:54,014 WARN L197 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 60 [2021-10-11 02:24:54,706 WARN L197 SmtUtils]: Spent 574.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 89 [2021-10-11 02:24:55,608 WARN L197 SmtUtils]: Spent 822.00 ms on a formula simplification. DAG size of input: 130 DAG size of output: 104 [2021-10-11 02:24:56,266 WARN L197 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 112 DAG size of output: 94 [2021-10-11 02:24:56,959 WARN L197 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 100 [2021-10-11 02:24:57,877 WARN L197 SmtUtils]: Spent 546.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 105 [2021-10-11 02:24:58,180 WARN L197 SmtUtils]: Spent 240.00 ms on a formula simplification. DAG size of input: 126 DAG size of output: 81 [2021-10-11 02:24:58,563 WARN L332 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2021-10-11 02:24:58,563 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2021-10-11 02:24:58,564 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2021-10-11 02:24:58,564 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206151323] [2021-10-11 02:24:58,564 INFO L461 AbstractCegarLoop]: Interpolant automaton has 12 states [2021-10-11 02:24:58,566 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2021-10-11 02:24:58,566 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2021-10-11 02:24:58,567 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=468, Unknown=0, NotChecked=0, Total=600 [2021-10-11 02:24:58,567 INFO L87 Difference]: Start difference. First operand 135 states and 160 transitions. Second operand 12 states. [2021-10-11 02:24:59,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2021-10-11 02:24:59,067 INFO L93 Difference]: Finished difference Result 283 states and 327 transitions. [2021-10-11 02:24:59,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2021-10-11 02:24:59,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 29 [2021-10-11 02:24:59,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2021-10-11 02:24:59,069 INFO L225 Difference]: With dead ends: 283 [2021-10-11 02:24:59,069 INFO L226 Difference]: Without dead ends: 257 [2021-10-11 02:24:59,070 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 61 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 300 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=190, Invalid=680, Unknown=0, NotChecked=0, Total=870 [2021-10-11 02:24:59,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2021-10-11 02:24:59,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 169. [2021-10-11 02:24:59,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 169 states. [2021-10-11 02:24:59,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 202 transitions. [2021-10-11 02:24:59,092 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 202 transitions. Word has length 29 [2021-10-11 02:24:59,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2021-10-11 02:24:59,092 INFO L481 AbstractCegarLoop]: Abstraction has 169 states and 202 transitions. [2021-10-11 02:24:59,092 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2021-10-11 02:24:59,092 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 202 transitions. [2021-10-11 02:24:59,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2021-10-11 02:24:59,094 INFO L414 BasicCegarLoop]: Found error trace [2021-10-11 02:24:59,094 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2021-10-11 02:24:59,321 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable115 [2021-10-11 02:24:59,322 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2021-10-11 02:24:59,322 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2021-10-11 02:24:59,322 INFO L82 PathProgramCache]: Analyzing trace with hash -1191301034, now seen corresponding path program 1 times [2021-10-11 02:24:59,323 INFO L162 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2021-10-11 02:24:59,323 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [444943720] [2021-10-11 02:24:59,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2021-10-11 02:24:59,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:24:59,379 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:24:59,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2021-10-11 02:24:59,418 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2021-10-11 02:24:59,440 INFO L173 FreeRefinementEngine]: Strategy SIFA_TAIPAN found a feasible trace [2021-10-11 02:24:59,441 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2021-10-11 02:24:59,441 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable171 [2021-10-11 02:24:59,477 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 02:24:59 BoogieIcfgContainer [2021-10-11 02:24:59,477 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2021-10-11 02:24:59,478 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2021-10-11 02:24:59,478 INFO L271 PluginConnector]: Initializing Witness Printer... [2021-10-11 02:24:59,478 INFO L275 PluginConnector]: Witness Printer initialized [2021-10-11 02:24:59,478 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 02:24:27" (3/4) ... [2021-10-11 02:24:59,480 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2021-10-11 02:24:59,519 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_f12eea4c-f5f2-4f5a-a93f-628949b02303/bin/utaipan-WLngWcDbfI/witness.graphml [2021-10-11 02:24:59,519 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2021-10-11 02:24:59,520 INFO L168 Benchmark]: Toolchain (without parser) took 33760.06 ms. Allocated memory was 86.0 MB in the beginning and 297.8 MB in the end (delta: 211.8 MB). Free memory was 49.6 MB in the beginning and 251.5 MB in the end (delta: -201.9 MB). Peak memory consumption was 8.5 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:59,520 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 86.0 MB. Free memory was 59.2 MB in the beginning and 59.1 MB in the end (delta: 27.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2021-10-11 02:24:59,521 INFO L168 Benchmark]: CACSL2BoogieTranslator took 518.97 ms. Allocated memory was 86.0 MB in the beginning and 113.2 MB in the end (delta: 27.3 MB). Free memory was 49.5 MB in the beginning and 74.6 MB in the end (delta: -25.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:59,521 INFO L168 Benchmark]: Boogie Procedure Inliner took 55.86 ms. Allocated memory is still 113.2 MB. Free memory was 74.6 MB in the beginning and 72.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:59,522 INFO L168 Benchmark]: Boogie Preprocessor took 81.29 ms. Allocated memory is still 113.2 MB. Free memory was 72.6 MB in the beginning and 70.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:59,522 INFO L168 Benchmark]: RCFGBuilder took 902.29 ms. Allocated memory is still 113.2 MB. Free memory was 69.7 MB in the beginning and 71.3 MB in the end (delta: -1.6 MB). Peak memory consumption was 40.8 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:59,522 INFO L168 Benchmark]: TraceAbstraction took 32154.41 ms. Allocated memory was 113.2 MB in the beginning and 297.8 MB in the end (delta: 184.5 MB). Free memory was 70.7 MB in the beginning and 254.6 MB in the end (delta: -183.9 MB). Peak memory consumption was 1.6 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:59,523 INFO L168 Benchmark]: Witness Printer took 41.38 ms. Allocated memory is still 297.8 MB. Free memory was 254.6 MB in the beginning and 251.5 MB in the end (delta: 3.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2021-10-11 02:24:59,525 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.21 ms. Allocated memory is still 86.0 MB. Free memory was 59.2 MB in the beginning and 59.1 MB in the end (delta: 27.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 518.97 ms. Allocated memory was 86.0 MB in the beginning and 113.2 MB in the end (delta: 27.3 MB). Free memory was 49.5 MB in the beginning and 74.6 MB in the end (delta: -25.1 MB). Peak memory consumption was 8.4 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 55.86 ms. Allocated memory is still 113.2 MB. Free memory was 74.6 MB in the beginning and 72.6 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 81.29 ms. Allocated memory is still 113.2 MB. Free memory was 72.6 MB in the beginning and 70.3 MB in the end (delta: 2.3 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 902.29 ms. Allocated memory is still 113.2 MB. Free memory was 69.7 MB in the beginning and 71.3 MB in the end (delta: -1.6 MB). Peak memory consumption was 40.8 MB. Max. memory is 16.1 GB. * TraceAbstraction took 32154.41 ms. Allocated memory was 113.2 MB in the beginning and 297.8 MB in the end (delta: 184.5 MB). Free memory was 70.7 MB in the beginning and 254.6 MB in the end (delta: -183.9 MB). Peak memory consumption was 1.6 MB. Max. memory is 16.1 GB. * Witness Printer took 41.38 ms. Allocated memory is still 297.8 MB. Free memory was 254.6 MB in the beginning and 251.5 MB in the end (delta: 3.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: - CounterExampleResult [Line: 1036]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L1002] SLL* list = malloc(sizeof(SLL)); [L1003] list->next = ((void*)0) [L1004] COND FALSE !(!(list != ((void*)0))) [L1004] COND FALSE !(__VERIFIER_nondet_int()) [L1004] list->inner = malloc(sizeof(SLL)) [L1004] EXPR list->inner [L1004] list->inner->next = ((void*)0) [L1004] EXPR list->inner [L1004] list->inner->inner = ((void*)0) [L1004] EXPR list->inner [L1004] EXPR list->inner != ((void*)0) || list->inner == ((void*)0) [L1004] COND FALSE !(!(list->inner != ((void*)0) || list->inner == ((void*)0))) [L1006] SLL* end = list; [L1009] COND FALSE !(__VERIFIER_nondet_int()) [L1019] end = ((void*)0) [L1020] end = list [L1023] COND FALSE !(!(((void*)0) != end)) [L1025] COND TRUE ((void*)0) != end [L1027] int len = 0; [L1028] EXPR end->inner [L1028] SLL* inner = end->inner; [L1029] COND TRUE ((void*)0) != inner [L1031] COND TRUE len == 0 [L1032] len = 1 [L1035] COND FALSE !(!(((void*)0) != inner)) [L1036] EXPR inner->inner [L1036] COND FALSE !(!(((void*)0) == inner->inner)) [L1037] EXPR inner->next [L1037] COND FALSE !(!(((void*)0) == inner->next)) [L1038] EXPR inner->inner [L1038] inner = inner->inner [L1039] COND TRUE len == 1 [L1040] EXPR inner->inner [L1040] inner = inner->inner [L1029] COND TRUE ((void*)0) != inner [L1031] COND FALSE !(len == 0) [L1034] len = 2 [L1035] COND FALSE !(!(((void*)0) != inner)) [L1036] EXPR inner->inner [L1036] COND TRUE !(((void*)0) == inner->inner) [L1036] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 74 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 32.0s, OverallIterations: 15, TraceHistogramMax: 2, AutomataDifference: 4.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 835 SDtfs, 1613 SDslu, 1604 SDs, 0 SdLazy, 893 SolverSat, 159 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 336 GetRequests, 180 SyntacticMatches, 30 SemanticMatches, 126 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 784 ImplicationChecksByTransitivity, 15.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=169occurred in iteration=14, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 14 MinimizatonAttempts, 475 StatesRemovedByMinimization, 10 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 9.0s InterpolantComputationTime, 371 NumberOfCodeBlocks, 371 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 402 ConstructedInterpolants, 3 QuantifiedInterpolants, 119967 SizeOfPredicates, 39 NumberOfNonLiveVariables, 318 ConjunctsInSsa, 54 ConjunctsInUnsatCore, 20 InterpolantComputations, 11 PerfectInterpolantSequences, 8/20 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! Received shutdown request...